Re: Grammar ambiguity

"Ira D. Baxter" <>
10 Feb 2000 01:10:27 -0500

          From comp.compilers

Related articles
Grammar ambiguity (Joachim Durchholz) (2000-02-05)
Re: Grammar ambiguity (Ira D. Baxter) (2000-02-10)
Re: Grammar ambiguity (Robert Sherry) (2000-02-10)
Re: Grammar ambiguity (Jocelyn Coulmance) (2000-02-12)
Re: grammar ambiguity world! (Chris F Clark) (2000-02-12)
Re: Grammar ambiguity (Joachim Durchholz) (2000-02-12)
Re: grammar ambiguity (Chris F Clark) (2000-02-12)
Re: Grammar ambiguity (Charles E. Bortle, Jr.) (2000-02-13)
[9 later articles]
| List of all articles for this month |

From: "Ira D. Baxter" <>
Newsgroups: comp.compilers
Date: 10 Feb 2000 01:10:27 -0500
Organization: Posted via Supernews,
References: 00-02-015
Keywords: parse

The DMS Reengineering Toolkit may offer what you need. It come
equipped with a GLR parser generator, so it can parse languages with
local ambiguities (even unbounded lookahead). A nice property of GLR
grammars is that it takes very little effort to get a "reference"
grammar to act as a useful parser. As an example, we put the
Fortran90 grammar almost directly into DMS, in spite of considerably
ambiguities present in expressions with respect to element accesses.

The parser generator tool itself has a built-in heuristic ambiguity
checker; it attempts to find terminal strings leading to ambiguous

-- IDB

>In summary: Are there parser generators available that cover more than
>just LALR, and where the effort to tweak language syntax to a form
>that the generator will accept is so straightforward that I can easily
>infer whether the rewritten and the original syntax are still the same
>I don't have my hopes too far up, but I wanted to ask before giving

Post a followup to this message

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