The unofficial fork of the Tiny Parser Generator by Herre Kuijpers. The original code and documentation can be found in the article 'A Tiny Parser Generator v1.2' on CodeProject. It was first forked by SickheadGames, and this is a fork of the later.
It is an LL(1) recursive descent parser generator written in C# which can generate a scanner, parser, and parsetree file in either C#, VB, Java or C++ code. It's also an IDE allowing to design a grammar. The generated files do not contains any dependancy, its just standalone C#, VB, C++ or java files you can integrate in your projects. You can also integrate custom code directly in grammar files to evaluate the inputs.
As a real world example, TinyExe is provided on C#, Java and C++. TinyExe allow to interpret expression like :
- Literal only mathematical expressions: 4*(24/2-5)+14
- Mathematical expressions containing built-in function and constants: 5*5/(1+15.2), cos(Pi/4)*sin(Pi/6)^2
- Variables affectations: x := 42
- Function definitions: f(x) := f(x) := x^2, f(x) := sin(x) / cos(x)
- Boolean Expressions: x >= 5, x == true
- Basic string functions: "Hello " & "world", "Pi = " & Pi, Len("hello world")
- ...
The source code is licensed under the Code Project Open License (CPOL) .
These are the new features and fixes we have added to the original code:
- New features:
- Added Java and C++ support.
- Added TinyExe as an example (in C#, Java and C++)
- Command line building of parsers.
- Support for
[IgnoreCase]flag on terminal symbols. - Support
RegexCompiledoption to don't useRegexOptions.Compiledin Scanner regexs
- Fixes and small improvements:
- Fix
ParseErrorline numbers and reports it in the IDE. - Fix Regex tool updates flickering.
- Display the offending character on unexpected token errors.
- Display the list of expected tokens on errors.
- Supports
varkeyword in syntax highlighting. - Upgraded to C# 8.x.
- Fix
The latest source code can be found in zip form here. The lastest build can be found in the releases page.