Imperator Parser Generator

Path: root/projects/Imperator/

(*2009-01-25 / gen 2010-05-09)

About

Motivation

I decided that investing time into writing my own parser generator might be a good idea, considering the experience I gathered from writing languages without one. So here it is, a parser generator for context-free grammars, with nested lookaheads, specializations for tokens (e.g. for keywords) and other things.

Some features

Clean and actually debugable C# parser output
Properly specified input language (with self-defining grammar)
Includes a few example grammars
Deployment of the generated parsers is trivial
Usage of the generated parsers is made comfortable by a clear distinction between rule instances and tokens, and typing according to the grammar being represented by enums in the output nodes
Token images, line and char numbers are all available for use

C++ parser output is planned, and maybe the release of the whole source of that thing too.

Downloads - Top-Level

v. 2010-05-09 (26 kiB)

rule and token sequences must contain at least one thing now
various bugfixes and improvements

Downloads - Older Versions

v. 2009-11-01 (34 kiB)

various small bugfixes for the generated C# code
incompatible change: RuleType is now NodeType

v. 2009-04-14.2 (37 kiB)

when a private/inline rule is used in another one, it must now be preceded with '#' at the place of usage too
fixed multiline comment rule
added match any char rule (~[])
added standard documentation tags to C# output to prevent compiler warnings with commenting enabled
reduced generation of unused local variables in generated code a bit
added line/char display of problems in the grammar source file if any occur
(.2) small fix for a potential bug

v. 2009-01-29 (31 kiB)

bugfix C#: index is now properly preserved when a sequence of the last branch of a choice is not passed fully

v. 2009-01-25 (26 kiB)

initial release