How to perform Left-Factoring on a Grammar, make it LL(1)

Asked Mar 22 '14 at 14:05

Active Dec 27 '14 at 16:43

Viewed 147 times

This is the grammar I have that is not left recursive. I have to make it LL(1). How do I go about doing this?

S -> Exp eof
Exp -> Term Exp2
Exp2 -> + Term Exp2 | - Term Exp2| e 
Term -> Factor Term2
Term2 ->  * Factor Term2 | / Factor Term2 | e 
Factor -> id | num | Fncall | Aref | (Exp)
Fncall -> id (Arguments)
Aref -> id [Indices]
Arguments -> Exp | Exp, Arguments
Incides -> Exp | Exp, Indices

edited Dec 27 '14 at 16:43

Brian Tompsett - 汤莱恩

5,753
72
57
129

asked Mar 22 '14 at 14:05

user2352335

I don't really understand how LL(1) works or what it means, so I'm kinda stuck – user2352335 Mar 22 '14 at 16:00
How is it that you have to do this work, but you don't understand the work you have to do? – Ira Baxter Mar 22 '14 at 16:57
It wasn't made clear in our practical so I've been left to figure it out myself – user2352335 Mar 22 '14 at 17:10

How to perform Left-Factoring on a Grammar, make it LL(1)

0 Answers0