Bounded context syntactic analysis

Authors:
Robert W. Floyd
Affiliations:
Computer Associates, Inc., Wakefield, MA
Venue:
Communications of the ACM
Year:
1964

Citing 5
Cited 40

A Descriptive Language for Symbol Manipulation

Journal of the ACM (JACM)
Detection of Generative Ambiguities in Context-Free Mechanical Languages

Journal of the ACM (JACM)
Syntactic Analysis and Operator Precedence

Journal of the ACM (JACM)
Sequential formula translation

Communications of the ACM
On GAT and the construction of translators

Communications of the ACM

Noncorrecting syntax error recovery

ACM Transactions on Programming Languages and Systems (TOPLAS)
An LR substring parser for noncorrecting syntax error recovery

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
The Cellar Principle of State Transition and Storage Allocation

IEEE Annals of the History of Computing - Special issue on the history of computing in France—machines
Substring parsing for arbitrary context-free grammars

ACM SIGPLAN Notices
Continuous grammars

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parenthesis Grammars

Journal of the ACM (JACM)
General Problems of Formal Grammars

Journal of the ACM (JACM)
Weak and Mixed Strategy Precedence Parsing

Journal of the ACM (JACM)
On the Covering and Reduction Problems for Context-Free Grammars

Journal of the ACM (JACM)
Canonical Precedence Schemes

Journal of the ACM (JACM)
On the Parsing of Deterministic Languages

Journal of the ACM (JACM)
Transforming LR(k) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars

Journal of the ACM (JACM)
A List Structure Form of Grammars for Syntactic Analysis

ACM Computing Surveys (CSUR)
Noncanonical SLR(1) Grammars

ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for the construction of bounded-context parsers

Communications of the ACM
The role of programming in a Ph.D. computer science program

Communications of the ACM
Use of transition matrices in compiling

Communications of the ACM
Translator writing systems

Communications of the ACM
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM
A global parser for context-free phrase structure grammars

Communications of the ACM
Programming Languages: Boolean matrix methods for the detection of simple precedence grammars

Communications of the ACM
A formal semantics for computer languages and its application in a compiler-compiler

Communications of the ACM
A parsing method on l-1 bounded context parsing

ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Compiler Construction in Higher Order Logic Programming

PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language

CL '00 Proceedings of the First International Conference on Computational Logic
Domolki's algorithm applied to generalized overlap resolvable grammars

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An algorithm generating the decision table of a deterministic bottom up parser for a subset of context free grammars

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The degree hierarchy of undecidable problems of formal grammars

STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Overview of the syntax processor generator SYNPROC

Proceedings of the international symposium on Extensible languages
On the construction of LR(k) analyzers

ACM '71 Proceedings of the 1971 26th annual conference
Syntactic constraints and efficient parsability

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
Empirical comparison of LR(k) and precedence parsers

ACM SIGPLAN Notices
Bounded context translation

AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
The XPL compiler generator system

AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Generating parsers for BNF grammars

AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
LR-regular grammars-an extension of LR(k) grammars

Journal of Computer and System Sciences
Generalized overlap resolvable grammars and their parsers

Journal of Computer and System Sciences
Error handling in a parallel LR substring parser

Computer Languages
Grammatical Codes Of Trees And Terminally Coded Grammars

Fundamenta Informaticae
Parallel parsing of operator precedence grammars

Information Processing Letters

Quantified Score

Hi-index	48.34

Visualization

Abstract

Certain phase structure grammars define languages in which the phrasehood and structure of a substring of a sentence may be determined by consideration of only a bounded context of the substring. It is possible to determine, for any specified bound on the number of contextual characters considered, whether a given grammar is such a bounded context grammar. Such grammars are free from syntactic ambiguity. Syntactic analysis of sentences in a bounded context language may be performed by a standard process and requires a number of operations proportional to the length of sentence analyzed.Bounded context grammars form models for most languages used in computer programming, and many methods of syntactic analysis, including analysis by operator precedence, are special cases of bounded context analysis.