Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Latex: a document preparation system
Latex: a document preparation system
The C programming language
C: a reference manual (3rd ed.)
C: a reference manual (3rd ed.)
Parsing and generation with static discontinuity grammars
New Generation Computing
On the complexity of ID/LP parsing 1
Computational Linguistics
Object Protocols as Functional Parsers
ECOOP '95 Proceedings of the 9th European Conference on Object-Oriented Programming
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Journal of Functional Programming
Evaluating GLR parsing algorithms
Science of Computer Programming - The fourth workshop on language descriptions, tools, and applications (LDTA'04)
Macros for context-free grammars
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms
Electronic Notes in Theoretical Computer Science (ENTCS)
Revealing the X/O impedance mismatch: changing lead into gold
SSDGP'06 Proceedings of the 2006 international conference on Datatype-generic programming
Languages generated by context-free grammars extended by type AB → BA rules
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
A permutation phrase is a grammatical phrase that specifies a syntactic construct as any permutation of a set of constituent elements. Permutation phrases allow for the concise and natural expression of free-order constructs as found in programming languages and notations such as C, Cobol, BibTEX, and Unix command lines.The conciseness and clarity of expression that permutation phrase grammars offer over context-free grammars are illustrated through a case study of the declarations in C. The parsing problem for permutation phrase grammars is considered, and it is shown how efficient linear-time parsing can be achieved for permutation phrase grammars satisfying an extended notion of the LL(1) property.