Compiler-Design
Question 38
|
(a) Remove left-recursion from the following grammar:
S → Sa| Sb | a | b
(b) Consider the following grammar:
S → aSbS| bSaS |ε
Construct all possible parse trees for the string abab. Is the grammar ambiguous?
Theory Explanation is given below.
|
Correct Answer: A
Subscribe
Login
0 Comments