|Visual BNF new version released email@example.com (AdamS) (2007-11-12)|
|Re: Visual BNF new version released firstname.lastname@example.org (Paul B Mann) (2007-11-16)|
|From:||"Paul B Mann" <email@example.com>|
|Date:||Fri, 16 Nov 2007 16:45:26 -0600|
|Keywords:||parse, tools, question|
> It creates Minimal LALR(1) states.
What is Minimal LALR(1) ?
I have never heard of this or a Maximal LALR(1).
I thought Minimal only pertained to LR(1) and using
Pager's algorithm to accomplish it.
> The generated lexers and parsers are very fast and process input in
> time linear with the size of the input.
Have you done any testing of the speed? Any benchmark results?
Paul B Mann
Return to the
Search the comp.compilers archives again.