A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(<italic>k</italic>) algorithm and the familiar top-downâ€¦ (More)

A formalism is presented for describing the actions of processors for programming languages—compilers, interpreters, assemblers—and their interactions in complex systems such asâ€¦ (More)

This paper describes a method of syntax description for programming languages which allows one to factor out that part of the description which deals with the relative precedences of syntactic units.â€¦ (More)

This paper presents a notation and formalism for describing the semantics of data structures. This is based on directed graphs with named edges and transformations on these graphs. In addition, andâ€¦ (More)

We discuss the thesis that one good way of achieving non-procedural or problem-oriented languages is by constructing higher and higher level procedural languages. We present a set of operationsâ€¦ (More)

We describe a high level of data structure description for programming languages which we call the relational level. At this level one may describe and manipulate data structures without having toâ€¦ (More)

We have isolated and characterized a cluster of three closely linked chicken U1 RNA genes from a lambda genomic library. These genes, which are completely collinear and homologous in sequence toâ€¦ (More)

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described. It is similar to both Knuth's LR(<italic>k</italic>) algorithm and the familiar top-downâ€¦ (More)

A method of incremental compilation is presented which applies especially to programming languages in which statements can be nested (such as Algol and PL/I). The method permits editing of the sourceâ€¦ (More)