B.Tech 2011 CS Compiler Construction (CC) previous year questions
Q.1 Consider the following grammar G:
E →TE'
T → +TE'/∈
T → FT'
T' → *FT'/∈
F → (E)/id
Where ∈ denotes the empty string of symbol
1. Complete FIRST and FOLLOW for each non terminal of the grammar G.
2. Construct a predictive parsing table for grammar G.
Q.2 Construct the tree for following expression and apply lebeling algorithm for optimal ordering x*(y+z)-z/(u-v)
View ALL
E →TE'
T → +TE'/∈
T → FT'
T' → *FT'/∈
F → (E)/id
Where ∈ denotes the empty string of symbol
1. Complete FIRST and FOLLOW for each non terminal of the grammar G.
2. Construct a predictive parsing table for grammar G.
Q.2 Construct the tree for following expression and apply lebeling algorithm for optimal ordering x*(y+z)-z/(u-v)
View ALL
