| Yacc, and the rest of its family |
| BNF (yacc) | |
| ? jaccl ? | |
| ? | |
| parser generator | |
| Dave Jones <djones@megatest.uucp> | |
| ? | |
| a LR(1) parser generator | |
| September 8th, 1989 |
| ABC | |
| ABC | |
| 1.04.01 | |
| interpreter/compiler | |
| Leo Geurts, Lambert Meertens, Steven Pemberton <Steven.Pemberton@cwi.nl> | |
| ftp://ftp.cwi.nl/pub/abc/* or http://www.cwi.nl/~steven/abc/ | |
| ABC is an imperative language embedded in its own environment. It is interactive, structured, high-level, very easy to learn, and easy to use. It is suitable for general everyday programming, such as you would use BASIC, Pascal, or AWK for. It is not a systems-programming language. It is an excellent teaching language, and because it is interactive, excellent for prototyping. ABC programs are typically very compact, around a quarter to a fifth the size of the equivalent Pascal or C program. However, this is not at the cost of readability, on the contrary in fact. | |
|
"The ABC Programmer's Handbook" by Leo Geurts,
Lambert Meertens and Steven Pemberton, published by
Prentice-Hall (ISBN 0-13-000027-2)
"An Alternative Simple Language and Environment for PCs" by Steven Pemberton, IEEE Software, Vol. 4, No. 1, January 1987, pp. 56-64. | |
| unix, MSDOS, atari, mac | |
| abc-list-request@cwi.nl | |
| abc@cwi.nl | |
| May 2nd, 1991 |
| BNF (yacc), Ada | |
| aflex-ayacc | |
| 1.2a | |
| parser generator (Ada), scanner generator (Ada) | |
| IRUS (Irvine Research Unit in Software) | |
| ftp://liege.ics.uci.edu/pub/irus/aflex-ayacc_1.2a.tar.Z | |
| Lex and Yacc equivalents that produce Ada output | |
| irus-software-request@ics.uci.edu | |
| irus-software-request@ics.uci.edu | |
| January 6th, 1993 |
| ? attribute grammar ? | |
| Alpha | |
| pre-release | |
| semantic-analysis generator?, documentation(german) | |
| Andreas Koschinsky <koschins@cs.tu-berlin.de> | |
| from author | |
| I have written a compiler generator. The generator is called Alpha and uses attribute grammars as specification calculus. Alpha is the result of a thesis at Technische Universitaet Berlin. I am looking for someone who would like to test and use Alpha. Alpha generates compilers from a compiler specification. This specification describes a compiler in terminology of attribute grammars. Parser and Scanner are generated by means of Bison and Flex. Alpha generates an ASE-evaluator (Jazayeri and Walter). The documentation is in german since it is a thesis at a german university. | |
| Febuary 16th, 1993 |
| BNF (??) | |
| ATS (Attribute Translation System) | |
| ? | |
| ? | |
| ? University of Saskatchewan ? | |
| ? | |
| generates table-driven LL(1) parsers with full insert-only error recovery. It also handles full left-attribute semantic handling, which is a dream compared to using YACC's parser actions. | |
| ? | |
| ? (suggested: Dave Bocking <bocking@cs.usask.ca>) | |
| November 29th, 1988 |
| BNF (yacc) | |
| bison | |
| 1.22 | |
| parser generator, documentation | |
| Robert Corbett and Richard Stallman | |
| ftp://gatekeeper.dec.com/bison-1.16.tar.Z or any other GNU archive site | |
| ? | |
| bug-gnu-utils@prep.ai.mit.edu | |
| !! will apply the GNU General Public License to *your* code !! | |
| unix, atari, ? | |
| September 14th, 1993 |
| BNF (yacc), Lex | |||||
| Bison++ and Flex++ | |||||
| 1.21-8 (bison), 2.3.8-7 (flex), 5 (flex++bison++misc) | |||||
| translator, documentation, postscript, examples, DOS binary | |||||
| Alain Coetmeur <coetmeur@icdc.fr> | |||||
| |||||
| A retargeting of bison-1 and flex 2.3 to C++, able to generate classes. As with Bison and Flex, these two tools are independent but designed for mutual compatibility. The version numbering has been changed for consistency with Flex and Bison, so versions of flex3.0.x and bison2.x of this package are are actually earlier versions, not later. Examples are provided to help in getting started. | |||||
| Mostly compatible with flex2.3 and bison 1 in C, apart from the ability to generate classes. | |||||
| Almost all symbol names can be redefined, parsers can be shared in C and C++ in the same headers... very extensible... flex++ support IOSTREAM and STDIO in C++. | |||||
| Contact coetmeur@icdc.fr (current author and maintainer). | |||||
| GNU License for bison++. Same as flex for flex++. | |||||
| SUNOS4, DOS, and same ports as Flex/Bison, Windows NT (tested) | |||||
| Larger memory model required on DOS (DOS binary supplied). | |||||
| active, supported, might not support flex 2.4 | |||||
| coetmeur@icdc.fr, news: comp.compiler, or comp.lang.c++ | |||||
| coetmeur@icdc.fr, news: comp.compiler, or comp.lang.c++ for substantial problems. | |||||
| see help, no commercial support. (volunteer ?) | |||||
| mail list locally maintained by coetmeur@icdc.fr, news: comp.compiler comp.lang.c++ | |||||
| Febuary 7th, 1994 |
| BNF (yacc) | |
| bison-A2.3 | |
| 2.3 (corresponds to gnu bison 1.22) | |
| parser generator, C-parser, C++parser, documentation | |
| Fred Hansen <wjh+@cmu.edu> | |
| ftp://ftp.andrew.cmu.edu/pub/AUIS/bison/bison-A2.2.tar.gz also in contrib/andrew on the XV11R6 distribution in directories overhead/bison, overhead/mkparser (but not the C++ version of the parser) | |
| This is the standard gnu bison with a number of improvments: license-free parsers for C and C++, only one external symbol for each grammar, permits multiple grammars per application, better error reports on the grammar. | |
| grammars are the same as bison and yacc; but run-time errors are handled differently, so semantic rules must be changed | |
| tokens in the grammar can be expressed as ">=" instead of GE | |
| send bugs to info-andrew-bugs@andrew.cmu.edu | |
| none (unless you use the native gnu-bison parser) | |
| has been tested on most Unix platforms | |
| generation of names for temp files is system dependent. | |
| info-andrew@andrew.cmu.edu (mirrored to comp.soft-sys.andrew) | |
| supported by the Andrew Consortium | |
| your organization is invited to join the Andrew Consortium info-andrew-request@andrew.cmu.edu | |
| May 9th, 1994 |
| BNF (yacc) | |
| byacc (Berkeley Yacc) | |
| 1.9 | |
| parser generator | |
| Robert Corbett <Robert.Corbett@eng.sun.com> | |
| ftp://vangogh.CS.Berkeley.EDU/pub/byacc.tar.1.9.Z | |
| probably the best yacc variant around. Previously known as Zoo, and before that, as Zeus. | |
| Febuary 22nd, 1993 |
| ANSI C, K&R C | |
| CDG - C Documentation Generator | |
| 1.3 | |
| documentation, document generator (all in one file) | |
| Peter Knoppers <P.Knoppers@ct.tudelft.nl> | |
| http://cardit.et.tudelft.nl/~knop/cdg13.tar.gz (Anonymous ftp not supported; use your WWW-browser and save it in a file.) | |
|
Cdg reads a set of C-source files and generates a two-column
listing of those sources where all lines are numbered. After
the listing part comes a three-column cross-reference table
which gives for each identifier a list of line-numbers where
this identifier occurs in the source listing part.
This format resembles the format that John Lions used in "Source Code and Commentary on UNIX level 6". | |
| Should operate on all K&R and ANSI C programs. There are some restrictions on the placement of matching #ifdef, #else and #endif directives, or else the way an identifier is used may be incorrectly determined. | |
| |
| None known (except the restriction mentioned under "conformance"). | |
| GNU conditions | |
| Unix, ANSI-C compiler (preferably gcc) (to build it), sort(1), PostScript printer, or HP DeskJet 500 or LaserJet printer, or GhostScript plus almost any popular printer. | |
| Linux | |
| Little experience at this time, should be quite portable. | |
| Works fine for the author... | |
| Email the author. | |
| Email the author. | |
| Email the author. | |
| http://cardit.et.tudelft.nl/~knop/index.html#cdg | |
| May 4 1999 |
| COCOL (EBNF variant) | |
| COCO/R | |
| 1.39 (Modula, Pascal, Oberon) | |
| parser generator(LL(1)) | |
| Hanspeter Moessenboeck <moessenboeck@ssw.uni-linz.ac.at> Port to Modula-2 done by Marc Brandis, Christof Brass and Pat Terry <cspt@cs.ru.ac.za> Port to Turbo Pascal done by Pat Terry and Volker Pohlers <pohlers@escher.hrz.fh-stralsund.de> | |
| ftp://ftp.inf.ethz.ch:/pub/software/Coco ftp://ftp.psg.com:/pub/modula-2/coco ftp://cs.ru.ac.za:/pub/coco ftp://ftp.fit.qut.edu.au:/pub/coco | |
| Coco/R generates recursive descent parsers and their associated scanners from attributed grammars. Coco/R can bootstrap itself to generate its own driver, parser, scanner, and semantic evaluator from the attributed grammar CR.ATG. This grammar thus serves as an an example of how to write compiler descriptions for Coco. There are also other simpler examples showing its use. | |
| _A compiler generator for microcomputers_, by Rechenberg and Moessenboeck (Prentice Hall, 1989, 0-13-155136-1) | |
| MS-DOS related versions: Pat Terry <cspt@cs.ru.ac.za> Other: Hanspeter Moessenboeck <moessenboeck@ssw.uni-linz.ac.at> | |
| Oberon, Modula-2, or Turbo Pascal | |
| MS-DOS: TopSpeed Modula-2; FST 2.0; FST 3.1 - 3.5; StonyBrook QuickMod 2.2; Logitech 3.03; Turbo Pascal. Macintosh: Apple MacMeth. Unix/Linux/FreeBSD: Mocka, Gardens Point. | |
| Oberon version is freely available. Modula-2 version is free to academic sites; commercial use requires a license | |
| November 1st, 1995 |
| COCOL (EBNF variant) | |
| Coco/R for C | |
| 1.05 | |
| Francisco Arzu <farzu@uvg.edu.gt> | |
| ftp://cs.ru.ac.za:/pub/coco/cocorc05.zip | |
| This is a C version of Professor Moessenboeck's Coco/R. Coco/R generates recursive descent parsers and their associated scanners from attributed grammars. Semantic attributes and semantic actions are a dream compared to YACC's and Lex's ones. There are many examples showing its use, including itself (it can bootstrap itself to generate its own driver, parser, scanner, and semantic evaluator from the attributed grammar CR.ATG) and a simple C like language which uses Iburg to generate intel 80x86 assemble language. | |
| parser generator(LL(1)), scanner generator, documentation, | |
| Francisco Arzu <farzu@uvg.edu.gt> | |
| Standard C compiler | |
| Many UNIX systems(Linux, UnixWare, SunOS, IBM AIX, HP-UX, etc) MS-DOS and OS/2 | |
| Next release will be under the GNU General Public License | |
| November 1st, 1995 |
| BNF (Yacc like description languages) | |
| Compiler Construction Tool Set (aka COCOM or Russian Armoury) | |
| 0.9 | |
| |
| Vladimir N. Makarov <vmakarov@usa.net> | |
| http://www.geocities.com/SiliconValley/Lab/4557 | |
| A set of compiler building tools. | |
| Unix, Linux | |
| very high (GNU configure) | |
| COCOM is actively developed | |
| Vladimir N. Makarov <vmakarov@usa.net> | |
| Vladimir N. Makarov <vmakarov@usa.net> | |
| January 5th, 1998 |
| Ml4 (extended EBNF) | |
| Depot4 | |
| 1.6 | |
| translator generator (->Java), documentation, examples | |
| Juergen Lampe <lampe@math.tu-dresden.de> | |
| ftp ftp.math.tu-dresden.de/Depot4/ | |
|
Depot4 generates recursive descent parsers and
translators.
Ml4 is a true extension of N.Wirth's EBNF. It features a unique translation=20 centred description, which makes it especially useful for people not educated in compiler construction. The Ml4 translator can bootstrap itself, thus serving as an example. Although translators are generated in a certain host language, their description is totally independent from this. Depot4 is intended for domain specific language implementation. | |
|
"An Extensible Translator-Generator for Use in Branch
Software Construction", J. Comp. and Inform. 2, 1 (1996), pp. 1057-1067 "A Generator for Dynamically Extensible Translators" in Proc. of JMLC'97 Joint Modular Languages Conference (Linz, 1997), pp. 75-87. "A tool for syntax directed software design" J. of Systems Architecture 43 (1997), pp. 199-202. | |
| |
| lampe@math.tu-dresden.de | |
| Java Virtual Machine supporting JDK 1.0.2 | |
| no futher restrictions | |
| active | |
| online manual at http://www.math.tu-dresden.de/wir/staff/lampe/Dp4Doc/UM.html | |
| lampe@math.tu-dresden.de | |
| 1997/06 |
| Ml4 (extended EBNF) | |
| Depot4/Oberon | |
| 1.6 | |
| translator generator (->Oberon), documentation, examples | |
| Juergen Lampe <lampe@math.tu-dresden.de> | |
| ftp ftp.math.tu-dresden.de/Depot4/ | |
| A Oberon version of Depot4 Accepts exactly the same language as Depot4/Java, cross translation, i.e. generation of translators in Java (and vice versa) possible | |
| "An Oberon-Based Implementation Tool" in "Advances in Modular Languages" P. Schulthess (ed), Universit=8Atsverl., Ulm, 1994, ISBN 3-89559-220-X, pp. 303-312. | |
| ETHZ Oberon V4 | |
| Oberon/F resp. Component Pascal ETHZ Oberon System3 possible | |
| online manual at http://www.math.tu-dresden.de/wir/staff/lampe/Dp4Doc/UM.html | |
| lampe@math.tu-dresden.de | |
| 1997/06 |
| EAG (Extended Affix Grammar) | |
| EAG | |
| first public release | |
| recognizer generator, transduccer generator, translator generator, editor generator, documentation | |
| Marc Seutter <marcs@cs.kun.nl> | |
| ftp://hades.cs.kun.nl/pub/eag/* | |
| The Extended Affix Grammar formalism, or EAG for short, is a formalism for describing both the context free and the context sensitive syntax of languages. EAG is a member of the family of two-level grammars. They are very closely related to two-level van Wijngaarden grammars. The EAG compiler will generate either a recognizer or a transducer or a translator or a syntax directed editor for a language described in the EAG formalism. | |
| September 14th, 1993 |
| BNF | |
| Eli | |
| 4.1.0 | |
| scanner generator (regular expressions->C, C++), parser generator (LALR->C, C++), attribute evaluator generator (LIDO->C, C++), definition table generator (PDL->C, C++), tree pattern-matcher generator (OIL->C, C++), pattern-based text generator (PTG->C, C++), unparser generator (Idem), command-line processing generator (CLP->C, C++), literate programming (FunnelWeb), integrated high-level debugger (Noosa), library with solutions for common tasks (ModLib), online and printable documentation | |
|
William Waite <waite@cs.colorado.edu> Basim Kadhim <kadhim@cs.colorado.edu> Uwe Kastens <uwe@uni-paderborn.de> Matthias Jung <mjung@uni-paderborn.de> Peter Pfahler <peter@uni-paderborn.de> Anthony Sloane <tony@cs.jcu.edu.au> | |
| http://www.cs.colorado.edu/~eliuser http://www.uni-paderborn.de/project-hp/eli.html http://www.cs.jcu.edu.au/~tony/eli.html | |
|
Eli is a fully integrated environment for the
automatic generation of processors of structured text.
It transparently utilises off-the-shelf tools and
libraries with specialized language processors to
generate complete processors quickly and reliably.
It simplifies the development of new special-purpose languages, implementation of existing languages on new hardware and extension of the constructs and features of existing languages. | |
| <elibugs@cs.colorado.edu> | |
| Eli is under the Free Software Foundation's General Public License. Code generated by Eli has no restrictions except that the dynamic memory allocation module (obstack) is covered by FSF's Library General Public License. | |
| High-level debugging requires Tcl/Tk (at least versions 7.6/4.2). | |
| SunOS (4.1.2, 5.4, 5.5), OSF1 (V3.0, V4.0), Linux (2.0.30 ELF), IRIX (5.3, 6.3), HP-UX (A.09.05) | |
| Portable to most Unix systems using FSF's autoconf support. | |
| active, supported | |
| <eli@cs.colorado.edu> (join at <eli-request@cs.colorado.edu>) | |
| <elibugs@cs.colorado.edu> | |
| comp.compilers, <eli@cs.colorado.edu> | |
| <compiler@cs.colorado.edu> <compiler@uni-paderborn.de> <tony@cs.jcu.edu.au> | |
| October 6th, 1997 |
| EBNF | |
| ETO | |
| test version | |
| parser, postscript document, examples | |
| Lin Li <china@bernina.ethz.ch> | |
| FTP://fi.ethz.ch/pub/ETO/eto-09.* | |
| ETO is an object oriented universal syntax checker. It takes an EBNF specification for a language and then uses it on an input file to check its syntax. | |
| June 3rd, 1994 |
| lex | |
| flex | |
| 2.5.2 | |
| scanner generator | |
| Vern Paxson <vern@ee.lbl.gov> | |
| ftp://ftp.ee.lbl.gov/flex-2.5.2.tar.Z or from a GNU archive site | |
| A POSIX-compliant "lex" scanner generator. | |
| vern@ee.lbl.gov or bug-gnu-utils@prep.ai.mit.edu | |
| April 28th, 1995 |
| BNF (??) | |
| FMQ | |
| ? | |
| paser generator w/error corrector generator | |
| Jon Mauney | |
| ftp://csczar.ncsu.edu | |
| ? | |
| ? | |
| ? | |
| March 31st, 1990 |
| BNF (Extended), BNF (yacc) | |||||
| GMD Toolbox for Compiler Construction (aka Cocktail) | |||||
| 9209 | |||||
|
lalr: parser generator (LALR(1) -> C, Modula-2),
ell : parser generator (LL(1) -> C, Modula-2),
rex : scanner generator (-> C, Modula-2),
bnf : translator (Extended BNF -> BNF),
y2l : translator (BNF (yacc) -> Extended BNF),
ast : abstract syntax tree generator,
ag : attribute-evaluator generator,
puma: transformation of abstract syntax tree using
pattern-matching
documentation, examples | |||||
| Josef Grosch <grosch@cocolab.sub.com> and others | |||||
|
| |||||
| A huge set of compiler building tools. | |||||
| (MS-DOS and MS-Windows only) DJ Delorie's DOS extender (go32) (OS/2 only) emx programming environment for OS/2 | |||||
| Unix, Linux, MS-DOS, MS-Windows, OS/2 | |||||
| very high | |||||
| version 9209 is unsupported, Cocktail is actively developed, versions 9401 and higher are commercial | |||||
| subscribe to Cocktail using listserv@eb.ele.tue.nl | |||||
| Josef Grosch <grosch@cocolab.sub.com> | |||||
| |||||
| October 1st, 1992 |
| ABC | |
| Grammar analysis tools | |
| 1 | |
| analysis tools, samples, documentation | |
| Steven Pemberton <Steven.Pemberton@cwi.nl> | |
| ftp://ftp.cwi.nl/pub/abc/examples/grammar/* or http://www.cwi.nl/~steven/abc/examples/grammar | |
| Grammar analysis program written in ABC (q.v.) for answering such questions as "what are the start symbols of all rules", "what symbols can follow this symbol", "which rules are left recursive", and so on. Includes a grammar of ISO Pascal. | |
| Ftp://archive includes an article explaining the package. | |
| unix, MSDOS, atari, mac | |
| Steven.Pemberton@cwi.nl | |
| July 5th, 1993 |
| BNF (Extended, actually a regular right part grammar) | |
| Gray | |
| 4 | |
| parser generator, documentation, examples | |
| Martin Anton Ertl <anton@mips.complang.tuwien.ac.at> | |
| ftp://server.complang.tuwien.ac.at/pub/forth/gray4.tar.gz ftp://server.complang.tuwien.ac.at/pub/forth/gray4.zip | |
| Gray is a parser generator written in Forth. It takes grammars in an extended BNF and produces executable Forth code for recursive descent parsers. | |
| Copyleft | |
| ANS Forth | |
| ANS Forth with some environmental dependences (see README) | |
| supported | |
| Several ANS Forth Systems; mail author for old versions running on Tile. | |
| August 8th, 1994 |
| BNF (variant), Icon | |
| Ibpag2 (Icon-Based Parser Generation System 2) | |
| 1.2 | |
| parser generator (Icon, SLR(1)) | |
| Richard L. Goerwitz <goer@midway.uchicago.edu> | |
| comp.sources.misc volume 44 | |
| Ibpag2 is a parser generator for Icon. It does most of what you would expect. Latest version can handle both SLR(1) and even GLR (Tomita) grammars. | |
| unix | |
| ? (Unix dependencies?) | |
| September 25th, 1994 |
| BURS ? | |
| Iburg | |
| ? | |
| parser generator? | |
| Christopher W. Fraser <cwf@research.att.com>, David R. Hanson <drh@princeton.edu>, Todd A. Proebsting <todd@cs.arizona.edu> | |
| ftp://ftp.cs.princeton.edu/pub/iburg.tar.Z | |
| Iburg is a program that generates a fast tree parser. It is compatible with Burg. Both programs accept a cost-augmented tree grammar and emit a C program that discovers an optimal parse of trees in the language described by the grammar. They have been used to construct fast optimal instruction selectors for use in code generation. Burg uses BURS; Iburg's matchers do dynamic programming at compile time. | |
| Febuary 10th, 1993 |
| BNF variant, Python | |
| kwParsing ? | |
| ? | |
| parser generator | |
| Aaron Watters <aaron@vienna.njit.edu> | |
| ftp://ftp.markv.com/pub/python/kwParsing.* | |
| A parser generator written in Python for Python. This package may be appropriate for experimental translators, code generators, interpreters, or compilers; for instructinal purposes; among other possibility. The documentation gives a brief introduction to the conventions and basic ideas of parsing. | |
| September 24th, 1994 |
| BNF | |
| lalr.ss - An LALR(1) parser generator | |
| 0.9 | |
| parser generator (->Scheme) | |
| Mark Johnson <mj@cs.brown.edu> | |
| ftp://the/new/lalr.shar Scheme Repository | |
| A LALR(1) parser generator in and for Scheme. | |
| Scheme | |
| May 24th, 1993 |
| BNF (yacc), Lex | |
| Lex/Yacc for Turbo Pascal uploaded | |
| ? | |
| parser generator, scanner generator, documentation? | |
| ? | |
| ftp://iecc.com/pub/file/lyprg.zip. | |
| Lex and Yacc retargeted to Pascal. | |
| ? dpoole@hydrogen.oscs.montana.edu (David Poole) | |
| July 2nd, 1993 |
| BNF (??) | |
| LLGen | |
| ? | |
| parser generator | |
| ? Fischer and LeBlanc ? | |
| ? ftp://csczar.ncsu.edu ? | |
| LL(1) parser generator | |
| subset of FMQ | |
| "Crafting A Compiler", by Fischer and LeBlanc | |
| ? | |
| ? | |
| March 31st, 1990 |
| BNF (yacc), Standard ML | |
| New SML-Yacc and SML-Lex | |
| ?? | |
| ?? | |
| Andrew Appel <appel@tyrolia.princeton.edu> | |
| princeton.edu/pub/ml, files mlyacc94.tar.Z, lexgen94.tar.Z. | |
| ?? | |
| May 23rd, 1994 |
| BNF (yacc) | |
| NewYacc | |
| 1.0 | |
| parser generator, documenation | |
| Jack Callahan <callahan@mimsy.cs.umd.edu> | |
| ftp://flubber.cs.umd.edu/src/newyacc.1.0.*.Z | |
| [someone want to fill it in? --ed] | |
| see Dec 89 CACM for a brief overview of NewYacc. | |
| Febuary 10th, 1992 |
| attribute-grammar extension of Yacc and Lex | |
| Ox | |
| G1.01 | |
| Yacc/Lex/C preprocessor, tutorial, reference manual, man page, examples, Ox-ready parsers (C, C++, Pascal, Ada, Fortran) | |
| Kurt Bischoff <bischoff@cs.iastate.edu> | |
| ftp://ftp.cs.iastate.edu/pub/ox/* | |
| Ox generalizes the function of Yacc in the way that attribute grammars generalize context-free grammars. Ordinary Yacc and Lex specifications may be augmented with definitions of synthesized and inherited attributes written in C syntax. Ox checks these specifications for consistency and completeness, and generates from them a program that builds and decorates attributed parse trees. Ox accepts a most general class of attribute grammars. The user may specify postdecoration traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. Ox is a preprocessor, and extends the syntax and semantics of Yacc, Lex, and C. | |
| Most compiler textbooks have descriptions of attribute grammars. | |
| LALR(1), semantic-analyzer generation. | |
| none known. Report bugs to ox-project@cs.iastate.edu. | |
| Use of Ox is free. Ox-generated code is the property of the Ox user. | |
| Unix | |
| ox-request@cs.iastate.edu | |
| November 14th, 1993 |
| BNF (Extended) | |
| PCCTS (Purdue Compiler-Construction Tool Set) | |
| 1.33 | |
| scanner generator, parser generator (pred-LL(k)), documentation, tutorial | |
| Terence J. Parr <parrt@parr-research.com>, Will E. Cohen <cohenw@ecn.purdue.edu>, Henry G. Dietz <hankd@ecn.purdue.edu>, Russell W. Quong <quong@ecn.purdue.edu> | |
|
PCCTS is similar to a highly integrated version of
YACC and LEX; where ANTLR (ANother Tool for Language
Recognition) corresponds to YACC and DLG (DFA-based
Lexical analyzer Generator) functions like LEX.
PCCTS grammars contain specifications for lexical and syntactic analysis with selective backtracking ("infinite lookahead"), semantic predicates, intermediate-form construction and sophisticated parser exception handling. Rules may employ Extended BNF (EBNF) grammar constructs and may define parameters, return values and local variables. Languages described in PCCTS are recognized via predicated-LL(k) parsers constructed in pure, human-readable, C/C++ code; the C++ programming interface is very good. The documentation is complete, but distributed over an original manual plus multiple release notes. A book is in the works and should be available 1Q 1996. A recently-developed PCCTS-based C++ parser is available at the ftp://site; it is an *initial* release and was derived from the grammar built by NeXT, Inc.. | |
| The tool is totally public domain--it has no legal restrictions on its use or incorporation into commercial applications. | |
| Unix, DOS, Windows, OS/2, Macintosh, NeXT | |
| very high | |
| comp.compilers.tools.pccts | |
| Terence J. Parr <parrt@acm.org> | |
| October 5th, 1995 |
| BNF (yacc), Perl | |
| perl-byacc | |
| 1.8.2 | |
| parser-generator(perl) | |
| Rick Ohnemus <Rick_Ohnemus@Sterling.COM> | |
| ftp://ftp.sterling.com/local/perl-byacc.tar.Z | |
| A modified version of byacc that generates perl code. Has '-p' switch so multiple parsers can be used in one program (C or perl). | |
| Should work on most (?) Unix systems. Also works with SAS/C 6.x on AMIGAs. | |
| January 24th, 1993 |
| BNF (very extended), yacc | |
| PRE-CC Xtended | |
| 2.30 | |
| library, parser generator (LL(oo)), translator(yacc->) | |
| Peter Breuer | |
| ftp://ftp.comlab.ox.ac.uk/pub/Programs/preccx.tar.Z (Unix) ftp://ftp.comlab.ox.ac.uk/pub/Programs/preccx.msdos (MS-DOS) ftp://ftp.comlab.ox.ac.uk/pub/Documents/techpapers/Jonathan.Bowen/preccx-uug.ps.Z (more recent versions available by subscription) URL: http://www.comlab.ox.ac.uk/archive/redo/precc.html | |
|
PRECCX is an infinite-lookahead compiler compiler for context
dependent grammars. The generated code is ANSI C.
Specification scripts are in very EBNF with inherited and synthetic attributes allowed. Scripts can be compiled in separate modules, and linked together later. Meta-production rules allowed. The technology is essentially LL(oo) with optimizations. A converter for yacc scripts is available. | |
|
"The PRECC Compiler-Compiler" by P.T. Breuer and J.P. Bowen.
In E. Davies and A. Findlay (eds.),
Proc. UKUUG/SUKUG Joint New Year 1993 Conference,
St. Cross Centre, Oxford, UK, 6-8 January 1993,
ISBN 1 873611 06 4 (UKUUG), 0 9520700 0 6 (SUKUG)
UKUUG/SUKUG Secretariat, Owles Hall, Buntingford,
Herts SG9 9PL, UK, pp 167-182, 1993.
"A PREttier Compiler-Compiler: Generating Higher Order Parsers in C" P.T. Breuer and J.P. Bowen. Oxford University Computing Laboratory Technical Report PRG-TR-20-92, 25pp, November 1992. Accepted by Software - Practice and Experience, 1994. ftp://ftp.comlab.ox.ac.uk/pub/Documents/techreports/TR-20-92.ps.Z | |
| unix, MS-DOS | |
| Peter Breuer <ptb@comlab.ox.ac.uk>, Jonathan Bowen <bowen@comlab.ox.ac.uk> | |
| June 2nd, 1994 |
| BNF ?, Gofer | |
| Ratatosk (?) | |
| ? | |
| parser generatr (Gofer) | |
| Torben AEgidius Mogensen <torbenm@diku.dk> | |
| ftp://ftp.diku.dk/pub/diku/dists/Ratatosk.tar.Z | |
| Ratatosk is a SLR parser generator in Gofer (a Haskell variant) that generates purely functional parsers (also in Gofer). Even though the sematic value of a production is a function of the attributes of its right-hand side (and thus apparently purely synthesized), inherited attributes are easily simulated by using higher order functions. | |
| ? | |
| ? |
| Regular Expressions | |
| re2c | |
| alpha | |
| translator (re->c) | |
| ?? peter@csg.uwaterloo.ca | |
| ftp://csg.uwaterloo.ca/pub/peter/re2c.0.5.tar.gz | |
| A regular expression to C converter. | |
| ?? April 29th, 1994 |
| attribute grammar | |
| Rie | |
| 1.0.6 | |
| compiler generator, attribute evaluator generator | |
| Masataka Sassa, Kazuhiro Kuroishi, Teruhisa Hirai and Yoshiki Ohshima | |
| ftp://ftp.is.titech.ac.jp/pub/Rie/* | |
|
Rie is a yet another compiler generator which is based on
a one-pass attribute grammar called ECLR-attributed grammar.
ECLR-attributed grammar is a superset of LR-attributed
grammar, and the generated compiler can evaluate both
inherited and synthesized attributes in parallel with LR
parsing without creating a parse tree. The style of the
Rie description is derived from Yacc, but the semantic
section of a production may contain attribution rules.
Because the specification is based on attribute grammar,
user can integrate syntax and semantics in one description.
Rie also accepts shorthand notations, context conditions
and `local' attributes, which are useful to write actual
compilers.
The generated compiler is only 1.8 times slower than a handwritten compiler. Rie generates an attribute evaluator in C source. The package includes sample descriptions of PL/0 compiler and of a sample of simple semantic analyzer, and documentation. | |
|
Sassa, M., Ishizuka, H., and Nakata, I.:
Rie, a Compiler Generator Based on a One-Pass
Attribute Grammar, Res. Rep. C-107, Dept. of Inf.
Sci., Tokyo Institute of Technology (Now, only a printed version is available. Contact rie-info@is.titech.ac.jp. Electric version will be available from ftp://ftp.is.titech.ac.jp/pub/Rie/Papers/* .) | |
| Bug reports are welcome to rie-comments@is.titech.ac.jp. | |
| Rie is implemented by modifying Bison, so Rie must be also covered by GNU General Public License version 2 and Bison's restriction. | |
| C compiler | |
| UNIX, DOS, etc. (same as bison) and Sharp X68000 | |
| We hope that it is stable | |
| rie-info@is.titech.ac.jp> | |
| September 20th, 1995 |
| Relation Grammar | |
| rl | |
| ? | |
| ? | |
| Kent Wittenburg <kentw@bellcore.com> | |
| flash.bellcore.com/rl/* | |
|
The RL files contain code for defining Relational Grammars and
using them in a bottom-up parser to recognize and/or parse
expressions in Relational Languages. The approach is a
simplification of that described in Wittenburg, Weitzman, and
Talley (1991), Unification-Based Grammars and Tabular Parsing
for Graphical Languages, Journal of Visual Languages and
Computing 2:347-370.
This code is designed to support the definition and parsing of Relational Languages, which are characterized as sets of objects standing in user-defined relations. Correctness and completeness is independent of the order in which the input is given to the parser. Data to be parsed can be in many forms as long as an interface is supported for queries and predicates for the relations used in grammar productions. To date, this software has been used to parse recursive pen-based input such as math expressions and flowcharts; to check for data integrity and design conformance in databases; to automatically generate constraints in drag-and-drop style graphical interfaces; and to generate graphical displays by parsing relational data and generating output code. | |
| Common Lisp | |
| Allegro Common Lisp 4.1, Macintosh Common Lisp 2.0 | |
| October 31st, 1992 |
| Candle, IDL (Interface Description Language) | |
| Scorpion System | |
| 6.0 | |
| software development environment for developing software development environments, documentation | |
| University of Arizona | |
| ftp://cs.arizona.edu/scorpion/* | |
|
20 tools that can be used to construct specialized
programming environments.
The Scorpion Project was started by Prof. Richard Snodgrass as an outgrowth of the SoftLab Project (which pro- duced the IDL Toolkit) that he started when he was at the University of North Carolina. The Scorpion Project is directed by him at the University of Arizona and by Karen Shannon at the University of North Carolina at Chapel Hill. | |
| "The Interface Description Language: Definition and Use," by Richard Snodgrass, Computer Science Press, 1989, ISBN 0-7167-8198-0 | |
| Sun-3, Sun-4, Vax, Decstation, Iris, Sequent, HP9000 | |
| info-scorpion-request@cs.arizona.edu | |
| scorpion-project@cs.arizona.edu | |
| November 4 1993 |
| BNF (extended) | |
| SORCERER: A Simple Tree Parser and Rewrite Generator | |
| 1.00B15 | |
| translator, documentation, tutorial, examples | |
| Terence Parr <parrt@parr-research.com>, Aaron Sawdey <sawdey@lcse.umn.edu>, Gary Funck <gary@intrepid.com> | |
| SORCERER is more suitable for the class of translation problems lying between those solved by code-generator generators and by full source-to-source translator generators. SORCERER generates simple, flexible, top-down, tree parsers that, in contrast to code-generators, may execute actions at any point during a tree walk. SORCERER accepts extended BNF notation, allows predicates to direct the tree walk with semantic and syntactic context information, and does not rely on any particular intermediate form, parser generator, or other pre-existing application. Both C and C++ based tree walkers can be generated. SORCERER is well integrated with PCCTS (soon SORCERER will be distributed with PCCTS). | |
|
Several listed in software documentation.
A book will available first quarter 1996; a pre-release version is available at the ftp site. | |
| Usenet newsgroup comp.compilers.tools.pccts | |
| newsgroup | |
| actively supported, from newsgroup and Parr Research Corporation <parrt@parr-research.com>. | |
| September 1st, 1995 |
| S/SL (Syntax Semantic Language) | |
| ssl | |
| ? | |
| parser bytecode compiler, runtime | |
| Rick Holt, Jim Cordy <cordy@qucis.queensu.ca> (language), Rayan Zachariassen <rayan@cs.toronto.edu> (C implementation) | |
| ftp://neat.cs.toronto.edu/pub/ssl.tar.Z | |
A better characterization is that S/SL is a language
explicitly designed for making efficient recusive-descent
parsers. Unlike most other languages, practicially the
LEAST expensive thing you can do in S/SL is recur. A
small language that defines input/output/error token
names (& values), semantic operations (which are really
escapes to a programming language but allow good
abstration in the pseudo-code), and a pseudo-code
program that defines a grammar by the token stream the
program accepts. Alternation, control flow, and
1-symbol lookahead constructs are part of the
language. What I call an S/SL "implementation", is a
program that compiles this S/SL pseudo-code into a
table (think byte-codes) that is interpreted by the
S/SL table-walker (interpreter). I think the pseudo-code
language is LR(1), and that the semantic mechanisms turn it
into LR(N) relatively easily.
| |
|
Cordy, J.R. and Holt, R.C. [1980] Specification of S/SL:
Syntax/Semantic Language, Computer Systems Research
Institute, University of Toronto.
"An Introduction to S/SL: Syntax/Semantic Language" by R.C. Holt, J.R. Cordy, and D.B. Wortman, in ACM Transactions on Programming Languages and Systems (TOPLAS), Vol 4, No. 2, April 1982, Pages 149-178. | |
| September 25th, 1989 |
| IDL (Project DOE's Interface Definition Language) | |
| SunSoft OMG IDL CFE | |
| 1.2 | |
| compiler front end, documentation | |
| SunSoft Inc. | |
| ftp://omg.org/pub/OMG_IDL_CFE_1.2/* | |
| OMG's (Object Management Group) CORBA 1.1 (Common Object Request Broker Architecture) specification provides the standard interface definition between OMG-compliant objects. IDL (Interface Definition Language) is the base mechanism for object interaction. The SunSoft OMG IDL CFE (Compiler Front End) provides a complete framework for building CORBA 1.1-compliant preprocessors for OMG IDL. To use SunSoft OMG IDL CFE, you must write a back-end; full instructions are included. A complete compiler of IDL would translate IDL into client side and server side routines for remote communication in the same manner as the currrent Sun RPCL compiler. The additional degree of freedom that the IDL compiler front end provides is that it allows integration of new back ends which can translate IDL to various programming languages. Several companies including Sunsoft are building back ends to the CFE which translate IDL into target languages, e.g. Pascal or C++, in the context of planned CORBA-compliant products. | |
| C++ 2.1 conformant C++ compiler | |
| idl-cfe@sun.com | |
| May 4 1993 |
| BNF (??) | |
| T-gen | |
| 2.1 | |
| parser generator, documentation, ? | |
| Justin Graver <graver@comm.mot.com> | |
| ftp://st.cs.uiuc.edu/pub/st80_r41/T-gen2.1/* | |
| T-gen is a general-purpose object-oriented tool for the automatic generation of string-to-object translators. It is written in Smalltalk and lives in the Smalltalk programming environment. T-gen supports the generation of both top-down (LL) and bottom-up (LR) parsers, which will automatically generate derivation trees, abstract syntax trees, or arbitrary Smalltalk objects. The simple specification syntax and graphical user interface are intended to enhance the learning, comprehension, and usefulness of T-gen. | |
| Smalltalk-80 | |
| ParcPlace Objectworks/Smalltalk 4.0 & 4.1 | |
| October 18th, 1992 |
| Attribute Grammars | |
| The FNC-2 Attribute Grammar System | |
| 1.14 | |
|
FNC-2: the Olga compiler and attribute evaluator generator;
ATC: a generator of abstract tree constructors driven by
bottom-up parsers, with two flavours, one on top of
SYNTAX, and one on top of Lex and Yacc;
PPAT: a generator of unparsers of attributed abstract trees, based on the TeX-like notion of nested boxes of text. | |
| Martin Jourdan, Didier Parigot and students | |
| http://www-rocq.inria.fr/charme/FNC-2/index.html ftp://ftp.inria.fr/INRIA/Projects/ChLoE/FNC-2/ | |
The FNC-2 system is a modern AG-processing system that
aims at production-quality by providing the following
qualities:
| |
|
form);
ML (Caml).
In addition, FNC-2 is the testbed for an active research team. | |
| Unix | |
| active | |
| <Didier.Parigot@inria.fr> or <Martin.Jourdan@inria.fr> | |
| 1995 |
| C, ANSI C, C++ | |
| The Roskind grammars | |
| cpp5 (cf2.0) | |
| parser(yacc), documenation | |
| Jim Roskind <jar@netscape.com> | |
|
The C grammar is CLEAN, it does not use %prec, %assoc, and
has only one shift-reduce conflict. The C++ grammar has
a few conflicts.
Also included is an extension to byacc that produces graphical parse trees automatically. | |
| the C grammar is true ANSI; the C++ grammar supports cfront 2.0 constructs. | |
| byacc 1.8 (for graphical parse trees) | |
| actively developed | |
| July 1st, 1991 |
| Pascal, Lisp, APL, Scheme, SASL, CLU, Smalltalk, Prolog | |
| Tim Budd's C++ implementation of Kamin's interpreters | |
| ? | |
| interpretors, documentation | |
| Tim Budd <budd@cs.orst.edu> | |
| ? ftp://cs.orst.edu/pub/budd/kamin/*.shar | |
| a set of interpretors written as subclasses based on "Programming Languages, An Interpreter-Based Approach", by Samuel Kamin. | |
| C++ | |
| ? | |
| Tim Budd <budd@fog.cs.orst.edu> | |
| September 12th, 1991 |
| BNF | |
| tom (demo for Tomita Parsing algorithm) | |
| 1 | |
| parser generator, parser interpreter, examples, documentation | |
| Mark Hopkins <mark@omnifest.uwm.edu> | |
| iecc.com in pub/files/tomita.tar.gz alt.sources archive from October 4, 1993. | |
| An implementation of the Tomita parsing algorithm using LR(0) tables and dynamic programming. | |
| Kluwer '91, _Generalized LR Parsing_, Tomita ed., 0-7923-9201-9 "The Tomita Parsing Algorithm ...", comp.compilers May 20, 1994 | |
| Cyclic context free grammars are processed. | |
| System independent | |
| October 3rd, 1994 |
| TXL | |
| TXL: Tree Transformation Language | |
| 7.4 | |
| translator, documentation, tutorial, examples | |
| Jim Cordy <cordy@qucis.queensu.ca> | |
| ftp://ftp.qucis.queensu.ca/pub/txl/* | |
| TXL is a language for performing source to source transformations and is well suited for rapidly prototyping new languages and language processors. It has also been used to prototype specification languages, command languages, and more traditional program transformation tasks such as constant folding, type inference, source optimization and reverse engineering. TXL takes as input an arbitrary context-free grammar in extended BNF-like notation, and a set of show-by-example transformation rules to be applied to inputs parsed using the grammar. TXL is a functional/rule-based hybrid programming language, using the paradigm of structural transformation. | |
| Several listed in software documentation | |
| August 4 1993 |
| Antlr 1.33 (PCCTS Development Tools) | |
| USQAGMS | |
| 1998.02.02 | |
| Grammar merger, documentation, additional small tools including Word Perfect grammar extraction macro. | |
| Ron House <house@usq.edu.au> | |
| httpd://www.sci.usq.edu.au/staff/house/usqagms/usqagms-manual.html | |
| USQAGMS is a grammar merger that combines actions from an old/obsolescent grammar with rules from an updated grammar. It is intended to assist language designers who are writing a compiler in parallel with making changes to the grammar. | |
| Processes Antlr 1.33 (PCCTS Development Tools) grammars. | |
| Ron House <house@usq.edu.au> | |
| Setting up for your language is a bit fiddly, but it saves heaps of work thereafter. | |
| Antlr 1.33 (PCCTS Development Tools) The grammar extraction macro requires Word Perfect (not an essential component). | |
| Linux. | |
| Should work on any Unix. | |
| Not officially supported, but I want to fix any bugs you might find. | |
| On web site and comp.compilers.tools.pccts. | |
| Ron House <house@usq.edu.au> | |
| Febuary 2nd, 1998 |
| BNF | |
| wacco | |
| 1.1, July 91 | |
| parser generator | |
| Parag Patel (parag@netcom.com, parag@sde.hp.com) | |
| comp.sources.misc volume ? | |
| Wacco is a recursive descent LL(1) parser generator that generates C++ code. Its syntax is similar to YACC with a lot of sugaring. It can also do attribute-driven parsing. The source is bootstrapped wacco code. | |
| HP-UX s300 and s800, Sparc, and 4.3BSD (on HP) | |
| Host machine must be 32 bits. | |
| ? | |
| ? |
| BNF (yacc) | |
| yacc | |
| 1.9.1 | |
| parser_generator | |
| Todd Dukes (ladco@tab.com) | |
| sunsite.unc.edu/pub/Linux/devel/lang/compiler_tools | |
| Yacc is a parser generator. It reads an input file that describes a grammar and generates C code that implements that grammar. It is designed to work well with 'lex' compatible lexers. Flex is a good program for generating these lexers. This version has improved support for C++. Yacc 1.9 generated C code that caused warnings and errors when compiled with C++. Minor changes were made in the declarations in the skeleton file to eliminate these warnings and errors. | |
| ? |
| BNF (??) | |
| ZUSE | |
| ? | |
| parser generator(?) | |
| Arthur Pyster | |
| ? Univ Calif at Santa Barbara ? | |
| ll(1) paser generator | |
| Pascal | |
| September 23rd, 1986 |
Please send updates to free-compilers@idiom.com
The HTML is maintained by David Muir Sharnoff and the entries themselves are currently maintained by Bryan Miller.
Copyright (c) 1992-1998 David Muir Sharnoff, All Rights Reserved
Copyright (c) 1994-1996, Steven Allen Robenalt, All Rights Reserved