Recent content by zulkifli

I have grammar S → ABaC | BaC | AaC | ABa | aC | Aa | Ba | a A → B | C | BC B → b C → D D → d Can someone please help me to eliminate all the rules of grammar production unit. Thanks for help! :biggrin:

Homework Statement Can anyone help me elimination of left recursive context-free grammar in the following S → SBa | Ab A → Sa | AAb | a B → Sb | BBa | a Thanks for your help! Homework Equations The Attempt at a Solution