Back to Search
Start Over
From left-regular to Greibach normal form grammars
- Source :
- Information processing letters, 9(1):10.1016/0020-0190(79)90109-1, 51-55. Elsevier
- Publication Year :
- 1979
-
Abstract
- Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a context-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of nonterminal symbols. In this short paper we show that for a left-regular grammar G we can obtain a right-regular grammar G’ (which is by definition in Greibach normal form) which left-to-right covers G (in this case left parses of G’ can be mapped by a homomorphism on right parses of G. Moreover, it is possible to obtain a context-free grammar G��? in Greibach normal form which right covers the left-regular grammar G (in this case right parses of G��? are mapped on right parses of G).
- Subjects :
- Grammar
Greibach normal form
business.industry
media_common.quotation_subject
Context-sensitive grammar
Context-free grammar
computer.software_genre
Computer Science Applications
Theoretical Computer Science
LL grammar
Combinatorics
Terminal and nonterminal symbols
Signal Processing
Noncontracting grammar
Homomorphism
Artificial intelligence
business
IR-66922
computer
Natural language processing
Information Systems
Mathematics
media_common
EWI-9212
Subjects
Details
- ISSN :
- 00200190
- Database :
- OpenAIRE
- Journal :
- Information processing letters, 9(1):10.1016/0020-0190(79)90109-1, 51-55. Elsevier
- Accession number :
- edsair.doi.dedup.....f8892a09e9ea833c360817bf9e351cf1
- Full Text :
- https://doi.org/10.1016/0020-0190(79)90109-1,