Question

1. According to grammar G(S)
S→a|∧|(T)
T→T，S|S
Q1. Draw the parsing tree for input sentence ((a，a)，a)
Q2. Write the rightmost derivation for input sentence ((a，a)，a)
Q3. Draw a line under the handle for each step

2. According to grammar G(S)：
S→(L)|a S|a
L→L，S|S
Q1. Modify the grammar by eliminating of left recursion and left factoring
Q2. compute the FIRST和FOLLOW set for each nonterminal
Q3. construct the LL(1) parsing table

f34ef86e6eeab3f2d56740d03df7543f.docx

Answer 1

Answer:

hihjkjhvvbbv। बीबीबी