DC C→ *DC | /DC |1 D→ a|(S) The non-terminals in this grammar are S', S, A, B, C, and D. The terminals are a, +, -, *, /, (, ), and $. For grading purposes, list terminals in your answers in the following order: a+-*/()$ For each production, list which next input symbol would predict the production (assuming that the production's left-hand side is on the top of the parsing stack). You should find your answer by building a prediction table as seen in class. In each answer list your set in the order given above. If a set is empty write exactly the word empty. Separate items using commas and no spaces. For example: a,-,/,) S → BA { A→ +BA { } A→ -BA { A→1{ В > DC { } C→ *DC { C→ /DC { C → { D→a|(S) { D→ (S) { "/>
Extracted text: Consider the context-free grammar below that generates mathematical expressions (it uses "a" as a placeholder for where values would go). S' → S$ S→ BA A→+BA|-BA|A В > DC C→ *DC | /DC |1 D→ a|(S) The non-terminals in this grammar are S', S, A, B, C, and D. The terminals are a, +, -, *, /, (, ), and $. For grading purposes, list terminals in your answers in the following order: a+-*/()$ For each production, list which next input symbol would predict the production (assuming that the production's left-hand side is on the top of the parsing stack). You should find your answer by building a prediction table as seen in class. In each answer list your set in the order given above. If a set is empty write exactly the word empty. Separate items using commas and no spaces. For example: a,-,/,) S → BA { A→ +BA { } A→ -BA { A→1{ В > DC { } C→ *DC { C→ /DC { C → { D→a|(S) { D→ (S) {