Parsing Expression Grammar

skjaero@gmail.com
31 Aug 2005 00:37:15 -0400

          From comp.compilers
Related articles
Parsing Expression Grammar skjaero@gmail.com (2005-08-31)
Re: Parsing Expression Grammar lfinsto1@gwdg.de (Laurence Finston) (2005-09-02)
Re: Parsing Expression Grammar rsc@swtch.com (Russ Cox) (2005-09-02)
Re: Parsing Expression Grammar cfc@shell01.TheWorld.com (Chris F Clark) (2005-09-02)
Re: Parsing Expression Grammar pohjalai@cc.helsinki.fi (A Pietu Pohjalainen) (2005-09-02)
Re: Parsing Expression Grammar owong@castortech.com (Oliver Wong) (2005-09-03)
Re: Parsing Expression Grammar pohjalai@cc.helsinki.fi (A Pietu Pohjalainen) (2005-09-07)
[27 later articles]
| List of all articles for this month |
From: skjaero@gmail.com
Newsgroups: comp.compilers
Date: 31 Aug 2005 00:37:15 -0400
Organization: Compilers Central
Keywords: parse, question
Posted-Date: 31 Aug 2005 00:37:15 EDT

Does anybody have working examples of a Parsing Expression Grammar
(http://en.wikipedia.org/wiki/Parsing_expression_grammar) for a Java
like language? I know the Rats! package generates parsers based on
PEG, but since Rats! is GPL`d I can`t use it for commercial use. It
would help to actually see the set of needed production rules for the
Java language as a base for designing a new language.


The reason for this is that I have a working VM implementation that I
need to test feed with bytecode samples, so it makes sense to start
bringing in the compiler step. As opposed to LL and RL parsers, PEG
parsers seem both more efficient AND unambiguous and handle context
free languages. I was wondering if Java, apart from the usual dangling
else conflicts, has been frame already in a PEG?


Cheers!


Post a followup to this message

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