Abstract
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.
- AHO, A. V., SETHI, R., AND ULLMAN, J.D. 1986. Compilers: Principles, Techniques and Tools. AddisomWesley, Reading, Mass.]] Google Scholar
- AMERICAN NATIONAL STANDARDS INSTITUTE. 1989. American National Standard for Information Systems--Programming Language--C. ANSI, New York.]]Google Scholar
- AMERICAN NATIONAL STANDARDS INSTITUTE. 1985. American National Standard for Information Systems--Programming Language--COBOL. ANSI, New York.]]Google Scholar
- BARTON, G. E., Jr. 1985. On tha complexity of ID/LP par~ing. Comput. LinE. 11, 4 (Oct.-Dee.), 205-218.]] Google Scholar
- COMPUTER SYSTEMS RESEARCH GROUP. 1986. UNIX User's Reference Manual--4.3 Berkeley Software Distribution. Univ. of California, Berkeley, Calif.]]Google Scholar
- DAHL, V. AND POPOWlCH, F. 1990. Parsing and generation with static discontinuity grammars. New Gen. Comput. 8, 3 (Dec.), 245-274.]] Google Scholar
- GAZDAR, G., KLEIN, E., PULLUM, G., AND SAG, I. 1985. Generahzed Phrase Structure Grammar. Basil Blackwell, Oxford, U.K.]]Google Scholar
- HARBISON, S. P. AND STEELE, G. L., JR. 1991. C, A Reference Manual. 3rd ed. Prentice Hall, Englewood Cliffs, N.J.]] Google Scholar
- KERNIGHAN, B. W. AND RITCHIE, D.M. 1988. The C Programming Language. 2nd ed. Prentice Hall, Englewood Cliffs, N.J.]] Google Scholar
- LAMPORT, L. 1986. LATEX: A Document Preparation System. Addison-Wesley, Reading, Mass.]] Google Scholar
- NELSON, G., (Ed.) 1992. Systems Programming in Modula-3. Prentice Hall, Englewood Cliffs, N.J.]]Google Scholar
- SHIEBER, S.M. 1984. Direct parsing of ID/LP grammars. Ltng. Philos. 7, 2, 135-154.]]Google Scholar
- U.S. DEPARTMENT OF DEFENSE. 1983. Reference Manual for the Ada Programming Language. ANSI/MIL-STD-1815A-1983, U.S. Dept. of Defense, Washington, D.C.]] Google Scholar
Index Terms
Extending context-free grammars with permutation phrases
Recommendations
How to Make Arbitrary Grammars Look Like Context-Free Grammars
Normal form theorems which factor arbitrary phrase-structure grammars into context-free grammars and “a little more” are presented. Every phrase-structure grammar is proven equivalent to one in which each production is either context-free or pure erasing. ...
Lexicalized context-free grammars
ACL '93: Proceedings of the 31st annual meeting on Association for Computational LinguisticsLexicalized context-free grammar(LCFG) is an attractive compromise between the parsing efficiency of context-free grammar (CFG) and the elegance and lexical sensitivity of lexicalized tree adjoining grammar (LTAG). LCFG is a restricted form of LTAG that ...
On a Construction of Context-free Grammars
The grammatical inference problem is solved for the class of context-free languages. A context-free language is supposed to be given by means of all its strings. Considering all strings of length bounded by k, context-free grammars G_{j,k} with 1≤j<k ...








Comments