Re: LR(1) Parser Generator

Tim Josling <tej@melbpc.org.au> wrote in message
> I am looking for the source for an LR(1) compiler, preferably
> written in C, and with open source licencing. Google cannot help.


Hi,


See the COCOM tool set (Russian Armoury) Vladimir Makarov,
vmakarov@users.sourceforge.net


http://sourceforge.net/projects/cocom/


The latest version (0.993) has an Earley parser.


Extracted form: http://cocom.sourceforge.net/index.html


4. MSTA (syntax description translator)


The MSTA can emulate YACC (Posix standard or System V Yacc). The MSTA
have the following additional features:


Fast LR(k) and LALR(k) grammars (with possibility resolution of
conflicts). Look ahead of only necessary depth (not necessary given
k). Originally LALR(k) parsers are generated by modified fast
DeRemer's algorithm. Parsers generated by MSTA are up to 50% faster
than ones generated by BISON and BYACC but usually have bigger size.
Extended Backus-Naur Form (EBNF), and constructions for more
convenient description of the scanners. More convenient naming
attributes. Optimizations (extracting LALR- and regular parts of
grammars and implementing parsing them by adequate methods) which
permit to use MSTA for generation of effective lexical analyzers. As
consequence MSTA permits to describe easily (by CFG) scanners which
can not be described by regular expressions (i.e. nested comments).
More safe error recovery and reporting (besides error recovery method
of YACC). Fast generation of fast parsers.


  ---
Marc

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