First page Back Continue Last page Overview Graphics
Parsing Expression Grammars
Consists of: (∑, N, R, eS)
- ∑: finite set of terminals (character set)
- N: finite set of nonterminals
- R: finite set of rules of the form “A e”,
where A ∈ N, e is a parsing expression.
- eS: a parsing expression called the start expression.