Title :
R68-46 Use of Transition Matrices in Compiling
Abstract :
Since BNF (context-free) grammars have been found so useful in describing the syntax of programming languages, a large number of parsing algorithms for context-free grammars have been developed for use in compilers and compiler-writing systems. A significant class of these algorithms have the following properties.
Keywords :
Computer languages; Matrix converters; Program processors;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1968.226868
