Related articles |
---|
LR(0) arithmetic grammar danx@mailru.com (Serge) (2001-02-12) |
From: | "Serge" <danx@mailru.com> |
Newsgroups: | comp.compilers |
Date: | 12 Feb 2001 01:14:04 -0500 |
Organization: | Commercal Information Networks |
Keywords: | parse, question |
Posted-Date: | 12 Feb 2001 01:14:04 EST |
Hi
I am looking for the best representation for arithmetic grammar that is
LR(0).
Non-LR(0) grammar is follows:
E:= E + T | T
T:= T * F | F
F:= (E) | i
where i is terminal symbol.
Does anyone know a solution?
Thanks in advice.
Serge
Return to the
comp.compilers page.
Search the
comp.compilers archives again.