|What is the Simplest Programming Language? email@example.com (merosonox) (2003-01-04)|
|Re: What is the Simplest Programming Language? firstname.lastname@example.org (2003-01-07)|
|Re: What is the Simplest Programming Language? email@example.com (Eliot Miranda) (2003-01-12)|
|Accent compiler compiler? firstname.lastname@example.org (Hugo Rozas) (2003-01-17)|
|Re: Accent compiler compiler? email@example.com (Georges LOUIS) (2003-01-21)|
|Re: Accent compiler compiler? firstname.lastname@example.org (Albert Hofkamp) (2003-01-21)|
|Re: Accent compiler compiler? email@example.com (Clint Olsen) (2003-01-25)|
|From:||Clint Olsen <firstname.lastname@example.org>|
|Date:||25 Jan 2003 00:43:19 -0500|
|References:||03-01-013 03-01-027 03-01-064 03-01-076|
|Posted-Date:||25 Jan 2003 00:43:19 EST|
Hugo Rozas wrote:
> I'am making a little personal hobby project and was thinking to use flex
> and bison, but surfing the web found this compiler compiler : Accent.
> What i like about it, is; It seems relative small and simple and has some
> advantages over Yacc. The problem is that it's a little unknown and I
> don't know if it really works and if it's bug free. Have anyone used it
> and can recommend it? Any comments would be appreciated.
One thing you don't mention is that although it is capable of
recognizing ambiguous grammars, this power does come with a resource
and performance penalty. The underlying algorithm is Earley which if
I'm not mistaken is n^3 wrt. the length of the input worst case. Of
course, with reasonable grammars with only limited amounts of
ambiguity this difference shouldn't be signifiant.
The package in general looks pretty interesting, but the licensing for
the parsing automaton is GPL, which may make it unattractive for folks
in the commercial sector.
Return to the
Search the comp.compilers archives again.