New Parser Generator Available

The SLK parser generator creates strong LL(k) parsing code modules.
These can be combined with a user developed lexical analyzer and action
code to produce recognizers or compilers. Some of the features of SLK
follow.


        Implements a new, efficient strong LL(k) grammar analysis algorithm.


        Produces table driven parsers that use a new strong LL(k) parsing
algorithm.


        The parsers are compact enough to be used in embedded applications.


        Modularity. The generated code is fully separate from the user code.
Actions are invoked by number through a call table.


        Supports a YACC style grammar syntax, with improvements.


        Also supports a new white space delimited syntax that accepts
grammars in the forms commonly found in published reference grammars.


        Includes extensive grammar debugging capabilities.


        Includes grammar transformation options like left factoring and left
recursion elimination.


        Handles the C++ ambiguity. Generates C or C++ code.


Please visit http://pages.prodigy.net/dr_feriozi for more information. A
compact evaluation package is available for download. It contains sample
source code that should enable a fairly quick evaluation of the product.
A free Win32 evaluation version of the parser generator is also
available for download. I would appreciate any feedback by email.

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