I was looking on some old exam questions for a course in my university, and stumbled upon an exercise that asked for the following: The starting grammar was this:

P --> this | that | P and P

and the students were asked to transform it to an LL(1) grammar in which and would be left associative (the complete grammar was more complex, but sorting out this simpler subset will suffice).

I cannot find a way to make the language left associative while avoiding left recursion, and searching on the internet was not very helpful. Anyone here willing to give a clue?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.