Re: converting this grammar to LL1

"SLK Parsers" <slk12@earthlink.net>
12 Nov 2002 14:09:32 -0500

          From comp.compilers
Related articles
converting this grammar to LL1 te-cheng_shen@agilent.com (Te-Cheng Shen) (2002-10-20)
Re: converting this grammar to LL1 chungyc@pobox.com (Yoo Chung) (2002-10-24)
Re: converting this grammar to LL1 joachim_d@gmx.de (Joachim Durchholz) (2002-10-24)
Re: converting this grammar to LL1 patrick.volteau@st.com (Patrick Volteau) (2002-10-25)
Re: converting this grammar to LL1 andreas.gieriet@externsoft.ch (Andreas Gieriet) (2002-10-25)
Re: converting this grammar to LL1 te-cheng_shen@agilent.com (Te-Cheng Shen) (2002-11-06)
Re: converting this grammar to LL1 joachim_d@gmx.de (Joachim Durchholz) (2002-11-07)
Re: converting this grammar to LL1 slk12@earthlink.net (SLK Parsers) (2002-11-12)
| List of all articles for this month |
From: "SLK Parsers" <slk12@earthlink.net>
Newsgroups: comp.compilers
Date: 12 Nov 2002 14:09:32 -0500
Organization: Parsers Inc.
References: 02-10-097 02-10-103 02-11-015
Keywords: parse
Posted-Date: 12 Nov 2002 14:09:32 EST

> Any rules to translate ambiguity from F->E[int]


This production by itself is not a problem. The ambiguity results from not
specifying the precedence between = and []. The solution is easy, yet
impossible for a deterministic algorithm, in the general case. You just have
to decide which language you want, and specify the grammar accordingly.


This grammar was well-chosen to illustrate the grammar development process.
A more detailed analysis of the grammar can be found at the Parsing Q&A page
http://parsers.org/parsing.html#6.


http://parsers.org/slk

Post a followup to this message

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