Abstract
A program called SID has been written which accepts as data a grammatical definition of a language and attempts to transform it into an equivalent grammar which can be parsed by a simple one-track parsing algorithm. Not all grammars can be so transformed, and if SID rails it reports the reason for its failure. If it succeeds, it further transforms the grammar rules that it has produced into a fast-running compiler written in machine code.

This publication has 0 references indexed in Scilit: