View Code? Open in Web Editor
NEW
Generating LR parser for a given grammar.
License: MIT License
create-lr-parser's Introduction
- Construct the parsing table
- Trace the parse stack of input string
- Draw the DFA
- Put each rule in a single line
- Rules must be in form
LHS => RHS
- NON-TERMINALS
- must start with (`)
- be UPPERCASE
- use only
[A-Z] and (_) for NONTERMINALS
- Terminals must be lower case
- If there are many rhs of a lhs
- put all in the same line
- separate them with (|)
- e.g.:
X => Y | Z | !εpslon
- Use the form (
!εpslon) for writing epslons
- Example grammar:
- `E => `T `E_
- `E_ => + `T `E_ | !εpslon
- `T => `F `T_
- `T_ => * `F `T_ | !εpslon
- `F => ( `E ) | id
- python 3
- numpy
- Pandas
- Matplotlib
- Networkx
- pygraphviz (optional)
create-lr-parser's People
Contributors
Watchers
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent