Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Communications of the ACM
Bounded context syntactic analysis
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
Automatic Question-Answering of English-Like Questions About Simple Diagrams
Journal of the ACM (JACM)
Information science in a Ph.D. computer science program
Communications of the ACM
Problems of improving the efficiency of parsing systems
COLING '69 Proceedings of the 1969 conference on Computational linguistics
ACM Transactions on Programming Languages and Systems (TOPLAS)
A contextual recognition system for formal languages
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Forest alignment with affine gaps and anchors, applied in RNA structure comparison
Theoretical Computer Science
| Hi-index | 48.25 |
An algorithm for analyzing any context-free phrase structure grammar and for generating a program which can then parse any sentence in the language (or indicate that the given sentence is invalid) is described. The parser is of the “top-to-bottom” type and is recursive. A number of heuristic procedures whose purpose is to shorten the basic algorithm by quickly ascertaining that certain substrings of the input sentence cannot correspond to the target nonterminal symbols are included. Both the generating algorithm and the parser have been implemented in RCA SNOBOL and have been tested successfully on a number of artificial grammars and on a subset of ALGOL. A number of the routines for extracting data about a grammar, such as minimum lengths of N-derivable strings and possible prefixes, are given and may be of interest apart from their application in this particular context.