A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
From left-regular to Greibach normal form grammars

1979
*
Information Processing Letters
*

Acknowledgment I am grateful

doi:10.1016/0020-0190(79)90109-1
fatcat:hv63skz57zbatingsruiqvtwui
*to*the referees for some corrections and their suggestions regarding the presentation of these results. ... 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 ... It is the aim of this paper*to*show that with our definition each*left*-*regular**grammar*(hence, also Ge) can be right covered and*left*-*to*-right covered by a*Greibach**normal**form**grammar*. ...##
###
Page 1982 of Mathematical Reviews Vol. , Issue 80E
[page]

1980
*
Mathematical Reviews
*

*From*

*left*-

*regular*

*to*

*Greibach*

*normal*

*form*

*grammars*. Inform. Process. ... Nijholt, Anton 80e:6819

*Grammar*functors and covers:

*from*non-

*left*-recursive

*to*

*Greibach*

*normal*

*form*

*grammars*. BIT 19 (1979), no. 1, 73-78. ...

##
###
Extended Context-Free Grammars and Normal Form Algorithms
[chapter]

1999
*
Lecture Notes in Computer Science
*

Speci cally, we introduce a new representation scheme for extended contextfree

doi:10.1007/3-540-48057-9_1
fatcat:6g2qxqmcw5a6ti4ycghlipzwuq
*grammars*(the symbol-threaded expression forest), a new*normal**form*for these*grammars*(dot*normal**form*) and new*regular*expression ... We investigate the complexity of a variety of*normal*-*form*transformations for extended context-free*grammars*, where by extended we mean that the set of right-hand sides for each nonterminal in such a*grammar*... As the modi ed*grammar*is no longer*left*recursive, we can now apply*left*back substitution*to*obtain a nal*grammar*in*Greibach**normal**form*. How well does this algorithm perform? ...##
###
Page 4575 of Mathematical Reviews Vol. , Issue 98G
[page]

1998
*
Mathematical Reviews
*

the

*Greibach**normal**form*properties, and then*to*use the standard method for chain rule elimination for the transformation of this*grammar*into*Greibach**normal**form*. ... cfg G’ in*Greibach**normal**form*. ...##
###
Normal form algorithms for extended context-free grammars

2001
*
Theoretical Computer Science
*

Speciÿcally, we introduce a new representation scheme for extended context-free

doi:10.1016/s0304-3975(00)00294-2
fatcat:mqc63mvs6ja6xcipb2ewdbbhx4
*grammars*(the symbol-threaded expression forest), a new*normal**form*for these*grammars*(dot*normal**form*) and new*regular*... We investigate the complexity of a variety of*normal*-*form*transformations for extended context-free*grammars*, where by extended we mean that the set of right-hand sides for each nonterminal in such a*grammar*... This research was supported under a grant*from*the Research Grants Council of Hong Kong SAR. It was carried out while the ÿrst and second authors were visiting HKUST. ...##
###
Left universal context-free grammars and homomorphic characterizations of languages

1981
*
Information and Control
*

Kasai called such a

doi:10.1016/s0019-9958(81)90170-4
fatcat:7rne6b7bwjb3hgf7l4rjocfq7i
*grammar*universal. (*Greibach*(1978) called it*left*universal.) ...*Greibach*(1978) defined that a*grammar*G with terminal vocabulary 27 is*left*universal for a class of languages L# and 2; with respect*to*a class of languages t 1 if for each language L over 2; in S, a ... ACKNOWLEDGMENT The authors would like*to*thank Professors Narnio Honda and Masayuki Kimura for their interest in this work. RECEIVED: September 27, 1980 ...##
###
An easy proof of Greibach normal form

1984
*
Information and Control
*

into equivalent context-free

doi:10.1016/s0019-9958(84)80013-3
fatcat:ypedrcyqgrg7nfq24kxta4mni4
*grammars*in*Greibach**normal**form*. ... We present an algorithm which given an arbitrary A-free context-free*grammar*produces an equivalent context-free*grammar*in 2*Greibach**normal**form*. ... equivalent one in*Greibach**normal**form*. ...##
###
Page 1436 of Mathematical Reviews Vol. , Issue 2000b
[page]

2000
*
Mathematical Reviews
*

Starting with an arbitrary e-free context- free

*grammar*G, we transform G into an equivalent context-free*grammar*H in extended*Greibach**normal**form*; i.e., in addition*to*rules fulfilling the*Greibach*...*normal**form*properties, the*grammar*can have chain rules. ...##
###
Page 2783 of Mathematical Reviews Vol. , Issue 80G
[page]

1980
*
Mathematical Reviews
*

Then it is possible

*to*construct a context-free*grammar*generating the Szilard language of the*normal**form*IO-*grammar*. ... “*To*solve this problem we first provide an algorithm which transforms an IO-*grammar*into a simple*normal**form*. ...##
###
Page 3793 of Mathematical Reviews Vol. , Issue 84i
[page]

1984
*
Mathematical Reviews
*

3793
Lee, Edward T.(1- MEMP) 84i:68131 Algorithms for finding Chomsky and

*Greibach**normal**forms*for a fuzzy context-free*grammar*using an algebraic approach. Kybernetes 12 (1983), no. 2, 125-134. ... Author’s summary: “Algorithms for the construction of the Chomsky and*Greibach**normal**forms*for a fuzzy context-free*grammar*using the algebraic approach are presented and illustrated by examples. ...##
###
Double Greibach operator grammars

2001
*
Theoretical Computer Science
*

Every context-free

doi:10.1016/s0304-3975(99)00138-3
fatcat:7yo35yxfwrhwrbqxh7xvrtyxfm
*grammar*can be transformed into one in double*Greibach*operator*form*, that satisÿes both double*Greibach**form*and operator*form*. ... Examination of the expressive power of various well-known subclasses of context-free*grammars*in double*Greibach*and=or operator*form*yields an extended hierarchy of language classes. ... This yields a new*normal**form*for context-free*grammars*(and derivation-bounded*grammars*), the double*Greibach*operator*normal**form*that satisÿes both double*Greibach**form*and operator*form*, and an extended ...##
###
Page 4895 of Mathematical Reviews Vol. , Issue 80M
[page]

1980
*
Mathematical Reviews
*

Author’s summary: “A new method is presented

*to*transform non-*left*-recursive*grammars**to**grammars*in*Greibach**normal**form*. ... It is shown that if the transformation is applied*to*a strict deterministic*grammar*, the newly obtained*grammar*in*Greibach**normal**form*is also strict deterministic.” ...##
###
Page 563 of Mathematical Reviews Vol. 58, Issue 1
[page]

1979
*
Mathematical Reviews
*

is

*left*covered by a*grammar*in*Greibach**normal**form*. (3) Every LR(k)*grammar*is right covered by a non-*left*-recursive LR(1)*grammar*. ... Among other similar results, the author shows that: (1) All context-free gram- mars cannot be right covered by a*grammar*in*Greibach**normal**form*. (2) Every unambiguous, e-free, non-*left*-recursive*grammar*...##
###
LL (1) Parser versus GNF inducted LL (1) Parser on Arithmetic Expressions Grammar: A Comparative Study

2020
*
Quaid-e-awam University research journal of engineering science & technology
*

The prime objective of the proposed study is

doi:10.52584/qrj.1802.14
fatcat:2gy57uthefakbgrstfncminxqm
*to*determine the induction of*Greibach**Normal**Form*(GNF) in Arithmetic Expression*Grammars**to*improve the processing speed of conventional LL(1) parser. ... The study adds*to*the knowledge of parsers itself, parser expression*grammars*(PEG's), LL(1)*grammars*,*Greibach**Normal**Form*(GNF) induced*grammar*structure, and the induction of Arithmetic PEG's LL(1) ... [31] worked on Chomsky*normal**form*(CNF) and Double*Greibach**normal**form*(DGNF) while inducing CNF*to*DGNF. ...##
###
Higher-order Context-free Session Types in System F

2022
*
Electronic Proceedings in Theoretical Computer Science
*

We present three notions of type equivalence: a syntactic rule-based version, a semantic bisimulation-based version, and an algorithmic version by reduction

doi:10.4204/eptcs.356.3
fatcat:r3ui7ktm75amdg6mjibqak4hne
*to*the problem of bisimulation of simple*grammars*... The mixture of functional types with session types has proven*to*be a challenge for type equivalence formalization: whereas functional type equivalence is often rule-based, session type equivalence usually ... expressive than*grammars*in*Greibach**normal**form*. ...
« Previous

*Showing results 1 — 15 out of 438 results*