Q). Consider the following directed acyclic graph (DAG):
The expression represented by above DAG is:
(A) $a+a+(a+a+a)$
(B) $a+a+(a+a+a+(a+a+a+a))$
(C) $a+a+(a+a+a+(a+a+a))$
(D) None
operator + is left associative.the expression has to be left asssociative.but the resulting grammar may be left of right recursive.
and answer has 4 a's in the expression
Abhijit Borah
I think, you are right.
64.3k questions
77.9k answers
244k comments
80.0k users