Elements of Formal Systems
Formal grammars, in particular context-free grammars, are the tools most frequently used to describe the structure of programs. They permit a lucid representation of that structure in the form of parse trees, and one can (for the most part mechanically) specify automata that will accept all correctly-structured programs (and only these). The automata are easy to modify so that they output any convenient encoding of the parse tree.
KeywordsFormal System Regular Expression Regular Language Finite Automaton Parse Tree
Unable to display preview. Download preview PDF.