A Supernormal-Form Theorem for Context-Free Grammars
Authors:
Open Access
- 1 January 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 30 (1) , 95-102
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Decidability and density in two-symbol grammar formsDiscrete Applied Mathematics, 1981
- Completeness of context-free grammar formsJournal of Computer and System Sciences, 1981
- On generators and generative capacity of EOL formsActa Informatica, 1980
- Power from power seriesLecture Notes in Computer Science, 1979
- Canonical forms of context-free grammars and position restricted grammar forms1977
- Canonical Forms of Context-Free Grammars and Position Restricted Grammar FormsLecture Notes in Computer Science, 1977
- A New Normal-Form Theorem for Context-Free Phrase Structure GrammarsJournal of the ACM, 1965
- Syntactic Analysis and Operator PrecedenceJournal of the ACM, 1963
- On certain formal properties of grammarsInformation and Control, 1959