Here is an implementation of a simplified analogue of the translator generator. It will automatically generate: Lexer and Parser for given grammar from the input file (*.gram)
- LL(1) grammars, top-down parsing
- synthesized attributes
- inherited attributes
- Generated with resulting generator - calculator
- Generated with resulting generator - С++ variable declaration
- Unit tests
The grammars given at the input must match grammar Examples: calc.gram and cdecl.gram