The expressions are compiled in the normal manner, the equivalent subexpressions being a.i Th(~ disposition of lhe parentheses is computed by number big the m ull;iplication signs consecutively. If n is divisible /)y 2 k but, not; by 2 kw, then (;he nt,h multiplication sign is 1-),'ecedcd by k right pat'entheses, and followed by k left parentheses.Expand

Parsing algorithms which do the best job of error recovery for syntactically incorrect object strings are those which are restricted to simpler forms of formal languages.Expand

An operational extensible language system is described. The system and its base language are appraised with respect to efficiency, flexibility, and utility for different categories of users.

This chapter describes the structure and use of a compiling system in which the translator is independent of the translation rules and, hence, isindependent of either the object or target language.Expand

This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages.Expand

The mechanism for treating recursive procedures described here is such that the costs in time and storage to procedures involved in recursion are no more than necessary for a completely general recursion mechanism for ALGOL 60.Expand