Skip to content

Abbreviations

  • PwZ - parsing with zippers
  • PwD - parsing with derivatives
  • RE - regular expressions
  • REE - regular expressions extended
  • REwLA - regular expressions with lookahead
  • PEG - parsing expressions grammar
  • MOG - multi-ordered grammar
  • Bool - boolean grammar
  • Conj - conjuctive grammar
  • ConjCont - conjuctive grammar with Context
  • LCRS - Left-child right-slibling binary tree
  • SPPF - shared packed parse forest
  • BNF - Backus–Naur form
  • EBNF - extended Backus–Naur form
  • ABNF - augumented Backus–Naur form
  • CFG - context free grammar
  • LL - CFG which is parsed form Left to right, and constructs a Leftmost derivation
  • LR - CGF which is parsed form Left to right, and constructs a Rightmost derivation
  • CSG - context sensitive grammar
  • DCFG - deterministic context-free grammar
  • DFA - deterministic finite automaton
  • NFA - nondeterministic finite automaton
  • DPDA - deterministic push down automaton
  • NPDA - nondeterministic push down automaton
  • LBA - linear bounded automaton
  • DTM - deterministic Turing machine
  • NTM - nondeterministic Turing machine
  • TM - Turing machine
  • Regex - regular expressions with backreferences
  • TAG - tree adjoining grammar
  • MG - minimalist grammar
  • AST - abstract syntax tree. See Parse tree
  • CST - concrete syntax tree. See Parse tree
  • EoF - end of file
  • LL
  • Recursive descent - see LL
  • Top-down parser - see LL
  • LR
  • Bottom-up parser - see LR