Re: LL(1) parser table

hyperarien@yahoo.com (lee)
14 Jan 2002 02:02:06 -0500

          From comp.compilers
Related articles
LL(1) parser table hyperarien@yahoo.com (2002-01-05)
Re: LL(1) parser table gsc@zip.com.au (Sean Case) (2002-01-07)
Re: LL(1) parser table dr_feriozi@prodigy.net (SLK Parsing) (2002-01-13)
Re: LL(1) parser table kaarthik@cisco.com (Kaarthik) (2002-01-13)
Re: LL(1) parser table kaarthik@cisco.com (Kaarthik) (2002-01-13)
Re: LL(1) parser table hyperarien@yahoo.com (2002-01-14)
| List of all articles for this month |
From: hyperarien@yahoo.com (lee)
Newsgroups: comp.compilers
Date: 14 Jan 2002 02:02:06 -0500
Organization: http://groups.google.com/
References: 02-01-026 02-01-039
Keywords: LL(1), parse
Posted-Date: 14 Jan 2002 02:02:06 EST

> > S -> E
> > E -> E-T | T
> > T -> T/F | F
> > F -> F++ | G
> > G -> ++E | id


I just realized that this transformation is still ambiguous.
It shpuld rather be:
S -> E
E -> E-T | T
T -> T/F | F
F -> F++ | G
G -> ++G | id


After this the LL1 parser table comes out to be unambiguous.


-lee

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.