ACM Computing Surveys (CSUR)
An Improved Context-Free Recognizer
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficient context-free parsing algorithm
Communications of the ACM
Communications of the ACM
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm
An efficient context-free parsing algorithm for natural languages and its applications
An efficient context-free parsing algorithm for natural languages and its applications
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
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Programming languages and their compilers: Preliminary notes
Programming languages and their compilers: Preliminary notes
Boolean matrix multiplication and transitive closure
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
A Framework Focus on Configuration Modeling and Integration with Transparent Persistence
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19
Parsing C/C++ Code without Pre-processing
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Chart mining-based lexical acquisition with precision grammars
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
On LR(k)-parsers of polynomial size
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Variability-aware parsing in the presence of lexical macros and conditional compilation
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
SFM'12 Proceedings of the 12th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: formal methods for model-driven engineering
Honu: syntactic extension for algebraic notation through enforestation
Proceedings of the 11th International Conference on Generative Programming and Component Engineering
An interactive parser generator for context-free grammars
Journal of Computing Sciences in Colleges
Jaccie: A Java-based compiler-compiler for generating, visualizing and debugging compiler components
Science of Computer Programming
Hi-index | 0.00 |
In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. ...