Regular languages - create
- DFA
- NFA
- regular grammar
- regular expression
| |
Regular languages - conversions
- NFA -> DFA -> Minimal DFA
- NFA <-> regular expression
- NFA <-> regular grammar
Regular languages - experiment with
|
| |
Context-free languages - create
- push-down automaton
- context-free grammar
Context-free languages - experiment with
|
| |
Context-free languages - transform
- PDA -> CFG
- CFG -> PDA (LL parser)
- CFG -> PDA (SLR parser)
- CFG -> CNF
- CFG -> LL parse table and parser
- CFG -> SLR parse table and parser
- CFG -> Brute force parser
| |
Recursively Enumerable languages
- Turing machine (1-tape)
- Turing machine (multi-tape)
- Turing machine (building blocks)
- unrestricted grammar
- unrestricted gramamr -> brute force parser
| |
L-Systems
|
| |