Consider the following Context-free Grammar: S id(L) L EI E PT TOE TE P...

Transcribed Image Text:

Consider the following Context-free Grammar: S → id(L) L→ EI E → PT TOE TE P→ id P→ (E) 0 → 0 →* 0 → / I →, L I → E The set of terminals for this grammar includes 'id'_,'+' The start symbol for this grammar is S. a) Compute the FIRST sets for all of the non-terminals in the grammar. (15 points) J J Stack Contents $$ S 'C', and the ','. b) Compute the FOLLOW sets for all of the non-terminals in the grammar. (15 points) c) Create an LL(1) parse table for this grammar. (15 points) d) Show the parse table execution for the following strings, so that you can check if they are part of the language of this grammar. (15 points): 1. id(id, id* (id+id)) (e.g. "f(x, y* (x+z))") 2. id(id, id(id)) (e.g. "f(x, g(y))") You should use a table like this one which was shown in class: Current Input id(id,id*(id+id))$$ Consider the following Context-free Grammar: S → id(L) L→ EI E → PT TOE TE P→ id P→ (E) 0 → 0 →* 0 → / I →, L I → E The set of terminals for this grammar includes 'id'_,'+' The start symbol for this grammar is S. a) Compute the FIRST sets for all of the non-terminals in the grammar. (15 points) J J Stack Contents $$ S 'C', and the ','. b) Compute the FOLLOW sets for all of the non-terminals in the grammar. (15 points) c) Create an LL(1) parse table for this grammar. (15 points) d) Show the parse table execution for the following strings, so that you can check if they are part of the language of this grammar. (15 points): 1. id(id, id* (id+id)) (e.g. "f(x, y* (x+z))") 2. id(id, id(id)) (e.g. "f(x, g(y))") You should use a table like this one which was shown in class: Current Input id(id,id*(id+id))$$

Answer rating: 100% (QA)

The answer provided below has been developed in a clear step b... View the full answer