Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Journal of the ACM (JACM)
ACM Computing Surveys (CSUR)
A system for typesetting mathematics
Communications of the ACM
A parser-generating system for constructing compressed compilers
Communications of the ACM
Communications of the ACM
Communications of the ACM
Design of a separable transition-diagram compiler
Communications of the ACM
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Some properties of precedence languages
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
Formal languages and their relation to automata
Formal languages and their relation to automata
Affix grammar driven code generation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Grammatical abstraction and incremental syntax analysis in a language-based editor
PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
The syntax definition formalism SDF—reference manual—
ACM SIGPLAN Notices
Scannerless NSLR(1) parsing of programming languages
PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Code generation using tree matching and dynamic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Controlled grammatic ambiguity
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental analysis of real programming languages
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Efficient and flexible incremental parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient tree pattern matching (extended abstract): an aid to code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Handling Operator Precedence in Arithmetic Expressions with Tree Transformations
ACM Transactions on Programming Languages and Systems (TOPLAS)
A new method for compiler code generation
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ACM SIGPLAN Notices
Iteration theorems for LL(k) languages (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
The SAGA project: A system for software development
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
LR parsers for natural languages
ACL '84 Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
An Experimental Ambiguity Detection Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
An experimental ambiguity detection tool
Science of Computer Programming
Pure and declarative syntax definition: paradise lost and regained
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
On the role of error productions in syntactic error correction
Computer Languages
Implementing conformiq Qtronic
TestCom'07/FATES'07 Proceedings of the 19th IFIP TC6/WG6.1 international conference, and 7th international conference on Testing of Software and Communicating Systems
| Hi-index | 48.22 |
Methods of describing the syntax of programming languages in ways that are more flexible and natural than conventional BNF descriptions are considered. These methods involve the use of ambiguous context-free grammars together with rules to resolve syntactic ambiguities. It is shown how efficient LR and LL parsers can be constructed directly from certain classes of these specifications.