Question

1. Consider the alphabet Σ = {a, b, c, $, #} and let G be the following grammar, where S is the start symbol.

   S→T
   S → T#S T→E
   T → T$E E→a E→b E→c

   a) Draw a parse tree for a#b#c.

   b) What is the associativity of the # operator? a) left b) right c) neither

c) What is the associativity of the $ operator? a) left b) right c) neither

d) Which operator has higher precedence? a) # b) $ c) neither

e) G is a) left recursive b) right recursive c) both left and right recursive d) neither left nor right recursive

f) G is

a) ambiguous
b) not ambiguous

Answer 1

Please find the answers below.