Compiler construction: theory and practice (2nd ed.)
Compiler construction: theory and practice (2nd ed.)
Compiler Construction for Digital Computers
Compiler Construction for Digital Computers
| Hi-index | 0.01 |
This paper introduces a formal method for determining if the production rules in a regular or context free grammar are "connected" (can appear in a sentential form) and "grounded" (can be driven to a string of terminal symbols). I have used it on several occasions in courses on programming language design or language translator implementation to verify that proposed student grammars were reduced (connected and grounded). The technique is also useful for reviewing matrix algebra and the theory of relations with students. The student must know or be introduced to Warshall's algorithm for generating the transitive closure of a relation [1--4].