Building syntax graphs from syntax equations: A case study in modular programming
Danny Crookes, R. Fee, V. Pickering · Software Practice and Experience · 1983
Abstract A system is described which inputs EBNF syntax equations as text, checks them and builds a corresponding syntax graph representation. An EBNF parser, with full error recovery, is included. The system is designed using the principles of modular decomposition and data abstraction, and is presented as a case study in the application of these principles to program design. The system is programmed in Pascal‐plus, and has been used as a basis for the automatic generation of parsers.