Brad Rodriguez
- Alfred Aho and Jeffrey Ullman, Principles of Compiler Design, Addison-Wesley, Reading, MA (1977). Google Scholar
Digital Library
- B. Rodriguez, "Pattern Matching in Forth," Proc 1989 FORML Conference, pp.143-156.Google Scholar
- B. Rodriguez, "Evolution of a Data-Structured Expert System in Forth," ME715 Project Report, McMaster University, Hamilton, Ont (1989).Google Scholar
Index Terms
- A BNF parser in FORTH
Recommendations
Backus-Naur form (BNF)
Encyclopedia of Computer ScienceBackus-Naur Form, named after John W. Backus of the US and Peter Naur of Denmark, and usually written BNF, is the best-known example of a meta-language (q.v.), i.e. one that syntactically describes a programming language. Using BNF it is possible to ...
More About Converting BNF to PEG
Concurrency, Specification and ProgrammingParsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. The parser has many useful properties. Converting PEG to an executable parser is a rather straightforward task. Unfortunately, PEG is not well understood as a ...
Generating parsers for BNF grammars
AFIPS '69 (Spring): Proceedings of the May 14-16, 1969, spring joint computer conferenceThe procedure described herein is in essence an extension, albeit a simplification, of the work Earley which in turn was based on Evans, Feldman, Floyd, and Standish. For a large subset of grammars, the procedure maps the Backus Naur Form (BNF) ...
Comments