Re: parsing ISO C++(1998/2003)

"Ira Baxter" <idbaxter@semdesigns.com>
28 Apr 2007 23:29:28 -0400

          From comp.compilers
Related articles
[4 earlier articles]
Re: parsing ISO C++(1998/2003) haberg@math.su.se (2007-04-23)
Re: parsing ISO C++(1998/2003) idbaxter@semdesigns.com (Ira Baxter) (2007-04-26)
Re: parsing ISO C++(1998/2003) torbenm@app-7.diku.dk (2007-04-26)
Re: parsing ISO C++(1998/2003) ang.usenet@gmail.com (Aaron Gray) (2007-04-27)
Re: parsing ISO C++(1998/2003) ang.usenet@gmail.com (Aaron Gray) (2007-04-27)
Re: parsing ISO C++(1998/2003) idbaxter@semdesigns.com (Ira Baxter) (2007-04-28)
Re: parsing ISO C++(1998/2003) idbaxter@semdesigns.com (Ira Baxter) (2007-04-28)
Re: parsing ISO C++(1998/2003) idbaxter@semdesigns.com (Ira Baxter) (2007-04-28)
| List of all articles for this month |
From: "Ira Baxter" <idbaxter@semdesigns.com>
Newsgroups: comp.compilers
Date: 28 Apr 2007 23:29:28 -0400
Organization: NewsGuy - Unlimited Usenet $19.95
References: 07-04-052 07-04-059 07-04-069 07-04-085 07-04-110 07-04-133
Keywords: parse, C++
Posted-Date: 28 Apr 2007 23:29:28 EDT

"Aaron Gray" <ang.usenet@gmail.com> wrote
> "Torben "Ęgidius" Mogensen" <torbenm@app-7.diku.dk> wrote in message
> > "Aaron Gray" <ang.usenet@gmail.com> writes:
> >
> > GLR parsers are able to parse ambiguous grammars, so this is trivially
> > true.
>
> The programmer has to program the points at which the GLR actually
> branches.


How so? All we write are simple context free grammar rules. These
rules may be collectively ambiguous. But other than that, we don't
write anything else. The GLR engine determines the branches by
looking at conflicts in the parsing tables. They are pretty easy to
detect.


--
Ira Baxter, CTO
www.semanticdesigns.com

Post a followup to this message

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