Question: 4. (4 marks) Use left-factoring and/or eliminate left-recursion to transform each of the below eight grammars into a form that is suitable for recursive-descent parsing.

4. (4 marks) Use left-factoring and/or eliminate left-recursion to transform each of the below eight grammars into a form that is suitable for recursive-descent parsing. As usual capital letters denote variables and lower case letters are terminals. (a) S dbSc | dba Sa | cbda baa (b) S - Sbc Sab | ac Sde la (c) S - Saba | Scc | E (d) S = ccdbSadcaSb | ccbSa (e) S-bbcSa | cSa | bbcad | doa (f) S SA A+ Ab a (g) SabcSd cdads | cdabs | abb | (h) S Sab | Sac | 6 | 0 Hint for (h): Here after elimination of left recursion you need to use also left-factoring (or vice versa)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
