Consider the following grammar and follow sets. The numbers to the left indicate the rule numbers for the state machine.

[answerhappygod]

Consider The Following Grammar And Follow Sets The Numbers To The Left Indicate The Rule Numbers For The State Machine 1 (77.71 KiB) Viewed 34 times

Consider the following grammar and follow sets. The numbers to the left indicate the rule numbers for the state machine. proof.txt 1 0 1 2 NI 3 4 5 2 S→ a Ef FOLLOW(S) = {$} FOLLOW (F) = {$} FOLLOW (E) = {f, y, $} Your job is to produce the item sets for this grammar. There are 11 states in the answer (Io to 110). Use -> for →, | for . • Use an empty production such as 5 -> for an e-production. • If a non-terminal has multiple productions, only the first should use the →→, the rest should use |. • If you add a non-terminal to a set because of taking a closure, the first production should also use →, even if it is repeated. 10. S. a E f {a: s1 } 1.x F { x: s2 } E→ You may not rename any symbols. • Spaces and newlines do not matter. • Actions are given in the form of a letter followed by a number. se is a shift to state 0, ge is a go-to action to state 0, re is a reduction using grammar rule 0. F→ We have given you the first state. The grader will tell you a percentage difference from the correct solution (using the edit distance) but scaled do that the original problem is at zero percent. It is guaranteed that some form of conversion is necessary. Ey a E | a F