Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-05) |
| Re: Grammar ambiguity idbaxter@semdesigns.com (Ira D. Baxter) (2000-02-10) |
| Re: Grammar ambiguity rsherry@home.com (Robert Sherry) (2000-02-10) |
| Re: Grammar ambiguity j.coulmance@itecor.com (Jocelyn Coulmance) (2000-02-12) |
| Re: grammar ambiguity world!cfc@uunet.uu.net (Chris F Clark) (2000-02-12) |
| Re: Grammar ambiguity joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-02-12) |
| Re: grammar ambiguity compres@world.std.com (Chris F Clark) (2000-02-12) |
| Re: Grammar ambiguity cbrtjr@ix.netcom.com (Charles E. Bortle, Jr.) (2000-02-13) |
| Re: Grammar ambiguity j.coulmance@itecor.com (Jocelyn Coulmance) (2000-02-19) |
| [8 later articles] |
| From: | Robert Sherry <rsherry@home.com> |
| Newsgroups: | comp.compilers |
| Date: | 10 Feb 2000 01:16:53 -0500 |
| Organization: | @Home Network |
| References: | 00-02-015 |
| Keywords: | parse |
I would recommend the PCCTS tool set. PCCTS stands for the
Pe Compiler Compiler Tool Set. It contains, among other things,
a parser generator. This parser generates generates an arbitrary look
ahead recursive decent parser. This parser, can parse any LR(k)
language not just LR(1).
PCCTS is free and you can download it from the web. The source
is included. Hope this helps.
Robert Sherry
Joachim Durchholz wrote:
>
> Hi all,
>
> I need a tool that checks context-free grammars for ambiguity. I
> already know that this is not decidable in general, so I'll have to be
> content with heuristics.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.