Help with LEX/YACC homework [was: First and Follow set for c grammar]

Please tell me if I did this homework correctly. If it not correct please provide directions which will help me understand it better.

5.1 Compute the first sets for the following grammar:
%token ID ‘==’ ‘<’ ‘>’ ‘(‘ ‘)’ ‘=’ ‘if’ ‘;’
%start Stmts
%%

Stmts : Stmt ‘;’ Stmts ;
Stmt : Var ‘=’ Expr
| ‘if’ Expr Stmt ;
Expr : ‘(‘ ID Op ID ‘)’ ;
Var : ID ;
Op : ‘>’
| ‘<’
| ‘==’ ;

First
Stmts { ID, ; }
Stmt { ID Op ID, ( }
Expr { ID Op ID, ( }
Var { ID }
Op { >, <, ==, }

5.2 Compute the follow sets for the grammar in question 5.1
Follow
Stmts { $, ; }
Stmt { $, ) }
Expr { ;, ) }
Var { $, ; }
Op { $, ; }


thanks in advance

Moved to other programming languages forum. This is a lex/yacc question rather than C

Thank you