Re: Visual BNF new version released

"Paul B Mann" <pbm@oct.net>
Fri, 16 Nov 2007 16:45:26 -0600

          From comp.compilers
Related articles
Visual BNF new version released adams7807@onet.eu (AdamS) (2007-11-12)
Re: Visual BNF new version released pbm@oct.net (Paul B Mann) (2007-11-16)
| List of all articles for this month |
From: "Paul B Mann" <pbm@oct.net>
Newsgroups: comp.compilers
Date: Fri, 16 Nov 2007 16:45:26 -0600
Organization: Compilers Central
References: 07-11-041
Keywords: parse, tools, question
Posted-Date: 16 Nov 2007 20:37:54 EST

> 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

Post a followup to this message

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