Abstract
This thesis documents several new developments in the theory of parsing, and also the practical value of their implementation in the Copper parser generator.
The most widely-used apparatus for syntactic analysis of programming languages consists of a scanner based on deterministic finite automata, built from a set of regular expressions called the lexical syntax, and a separate parser, operating on the output of this scanner, built from a context-free grammar and utilizing the LALR(1) algorithm.