350 Hits in 3.0 sec

Page 1982 of Mathematical Reviews Vol. , Issue 80E [page]

1980 Mathematical Reviews  
Lett. 9 (1979), no. 1, 51-55. 80e:68 189 From the introduction: “Each context-free grammar can be trans-° formed to a context-free grammar in Greibach normal form, that is, 2 context-free grammar where  ...  Context-free grammars with graph control.  ... 

Double Greibach operator grammars

Changwook Kim
2001 Theoretical Computer Science  
Every context-free 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  ... 
doi:10.1016/s0304-3975(99)00138-3 fatcat:7yo35yxfwrhwrbqxh7xvrtyxfm

Weak Greibach Normal Form for Hyperedge Replacement Grammars

Tikhon Pshenitsyn
2020 Electronic Proceedings in Theoretical Computer Science  
In this paper, we introduce a weak Greibach normal form, whose definition corresponds to the lexicalized normal form for string grammars, and prove that every context-free hypergraph language (with nonsubstantial  ...  Therefore, we expect that there is a generalization of the well-known Greibach normal form from string grammars to hypergraph grammars.  ...  Mati Pentus and anonymous reviewers for their valuable advices.  ... 
doi:10.4204/eptcs.330.7 fatcat:wg3nibxugbh73iub5ajjdntrha

Page 1064 of Mathematical Reviews Vol. , Issue 88b [page]

1988 Mathematical Reviews  
Rozenberg [Inform. and Control 63 (1984), no. 3, 190-199; MR 87h:68086] for producing a Greibach normal form grammar equivalent to a given context-free grammar.  ...  Greibach has also given a simple proof of the standard-form theorem for context-free grammars [see pp. II-1- II-4, Rep. No. NSF-18, Comput. Lab., Harvard Univ., Cambridge, Mass., 1967; per revr.].}  ... 

Page 2033 of Mathematical Reviews Vol. 54, Issue 6 [page]

1977 Mathematical Reviews  
There are LR(0) languages which cannot be given LR(0) grammars in Greibach form. Every LR(k) grammar may be given an LR(1) grammar in Greibach form.” S. A. Greibach (Los Angeles, Calif.) Gladkii, A.  ...  Authors’ summary: “It is shown that every strict deterministic language may be given a strict deterministic grammar which is also in Greibach normal form.  ... 

Complexity of normal form grammars

Alica Kelemenová
1983 Theoretical Computer Science  
Greibach normal form grammars and position restricted grammars will be investigated from the point of view of descriptional complexity of context-free languages.  ...  Various types of grammars can be used to describe context-free languages. Such are context-free grammars and their normal form restrictions.  ...  Such are context-free grammars and their normal form restrictions (e.g., Chomsky normai form, Greibach normal form, etc.).  ... 
doi:10.1016/0304-3975(83)90026-9 fatcat:6dcv7rdswzf3jmizgae2ufmi3a

Page 5380 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
Subramanian (6-MDRCC; Madras) 94i:68165 68Q50 Engelfriet, Joost (NL-LEID-CS; Leiden) A Greibach normal form for context-free graph grammars.  ...  This generalizes the dou- ble Greibach normal form of context-free grammars. Moreover, it provides a natural grammatical characterization of the context- free hypergraph languages of bounded degree.  ... 

Boundary graph grammars with dynamic edge relabeling

Joost Engelfriet, George Leih, Emo Welzl
1990 Journal of computer and system sciences (Print)  
Second, we show the existence of a Chomsky normal form and a Greibach normal form for B-eNCE grammars.  ...  First, there exists a Chomsky normal form and a Greibach normal form for B-eNCE grammars (and for LIN-eNCE grammars).  ...  CHOMSKY AND GREIBACH NORMAL FORM In formal language theory one of the first topics of research has been the search for normal forms for context-free string grammars.  ... 
doi:10.1016/0022-0000(90)90002-3 fatcat:lzgx7lbhxfexvcua6qvkwjq3jm

Normal form algorithms for extended context-free grammars

Jürgen Albert, Dora Giammarresi, Derick Wood
2001 Theoretical Computer Science  
Speciÿcally, we introduce a new representation scheme for extended context-free 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.  ... 
doi:10.1016/s0304-3975(00)00294-2 fatcat:mqc63mvs6ja6xcipb2ewdbbhx4

Past, present and future [chapter]

1980 Lecture Notes in Computer Science  
Thus productions of type A ÷ aB are not really necessary at all to obtain a Greibach-like two-standard normal form theorem for context-free grammars.  ...  of productions are or are not able to give normal forms for context-free grammars.  ... 
doi:10.1007/3-540-10233-7_5 fatcat:2wsb2nskz5gcbcduvt2rvtsra4

Page 978 of Mathematical Reviews Vol. 40, Issue 4 [page]

1970 Mathematical Reviews  
Let G be a context-free grammar with set of productions R, and let a regular set (p) be given for each production pe R.  ...  As main results of the paper, it is established that the type 1 fuzzy grammars generate recursive sets and that for any type 2 fuzzy grammar, equivalent Chomsky- and Greibach normal-form fuzzy grammars  ... 

Page 350 of Mathematical Reviews Vol. , Issue 84a [page]

1984 Mathematical Reviews  
grammar in Greibach normal form or in Chomsky normal form.  ...  For example, no 84a:68084 COMPUTER SCIENCE (including AUTOMATA) 350 grammatical conditions are known specifying precisely those context-free grammars which have an e-free covering grammar or a covering  ... 

Context-Free Languages and Pushdown Automata [chapter]

Jean-Michel Autebert, Jean Berstel, Luc Boasson
1997 Handbook of Formal Languages  
Greibach normal forms A context-free grammar G = (V; P) over the terminal alphabet A is in Greibach normal form i each rule of the grammar rewrites a variable into a word in AV ? .  ...  Normal forms In this section, we present three normal forms of context-free grammars. The two rst ones are the Chomsky normal form and the Greibach normal form.  ...  Index "-rule, 3 bracket operation, 49 Chomsky normal form, 15 Chomsky-Sch utzenberger's theorem, 25  ... 
doi:10.1007/978-3-642-59136-5_3 fatcat:5ikmp6unurdwbl773xucv4v3ni

Page 2110 of Mathematical Reviews Vol. 58, Issue 3 [page]

1979 Mathematical Reviews  
The author introduces a family Pt of context-free grammars where every grammar from J is associated with a pair of context-free grammars in Greibach normal form.  ...  The author gives context-sensitive generative grammars for the minuets in Notebooks for Anna Magdalena Bach 1725.  ... 

A graph-based regularity test for deterministic context-free languages

Priti Shankar, B.S. Adiga
1992 Theoretical Computer Science  
The lemma below shows that there is, in fact, a polynomial-time algorithm for deciding regularity if L has a grammar in reverse Greibach Normal Form, as the test reduces to checking if the associated LR  ...  From the construction of the ETS we conclude that there is a cycle c with (5, c) an MMCP. 0 Theorem 3.6 of the paper holds with the first line modified to: The test for regularity reduces to checking that  ... 
doi:10.1016/0304-3975(92)90272-h fatcat:snqqf72e2bar5gumglz7irsuyq
« Previous Showing results 1 — 15 out of 350 results