Formal languages
The new math of computer programming
Communications of the ACM
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
A mathematical theory of global program optimization (Prentice-Hall series in automatic computation)
Program equivalence and context-free grammars
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
| Hi-index | 0.00 |
An extension of the scheme grammar concept given by Urschler is formalized. It is also shown that, in the usual hierarchy of the theory of formal languages, the language generated by the scheme grummar is regular (type 3). The last section gives the description of a system for the automatic structuring of programs, which applies these concepts to the Mills algorithm with some modifications.