An efficient context-free parsing algorithm
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(k) algorithm and the familiar…
An efficient context-free parsing algorithm
A method for incrementally compiling languages with nested statement structure
Toward an understanding of data structures
A formalism for translator interactions
An efficient context-free parsing algorithm
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved