30 likes | 215 Views
Chapter 5. Names, Bindings, Type Checking, and Scopes. Write a grammar that can generate the following language L= { ab(bbaa) n bba(ba) n : n ≧ 0 }
E N D
Chapter 5 Names, Bindings, Type Checking, and Scopes
Write a grammar that can generate the following language L= { ab(bbaa)nbba(ba)n : n ≧ 0 } (hint) : You can use λto represent a character string with length 0 (i.e. an empty string) in the right hand side of your production rules.
Partial Answer S -> abB A -> aaBb …