Results 201 to 210 of about 1,698 (255)
Some of the next articles are maybe not open access.
Generalized context‐free grammars and multiple context‐free grammars
Systems and Computers in Japan, 1989AbstractIt is shown that the class of languages generated by generalized context‐free grammars (gcfg's) introduced by Pollard is exactly the class of recursively enumerable sets. Next, a subclass of gcfg's called multiple context‐free grammars (mcfg's) is introduced and it is shown that the class of languages generated by mcfg's properly contains the ...
Tadao Kasami +2 more
openaire +1 more source
Context-Free Categorical Grammars
2009We define generic categorical notions of rewriting and grammar, using two basic operations, pullback and pushout, and show that these categorical grammars are intrinsically context-free in the sense of Courcelle. We then specialise to various settings, including classical word grammars, hyperedge replacement grammars or node-replacement grammars.
Ly, Olivier, Bauderon, Michel, Chen, Rui
openaire +2 more sources
Grammars, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2016
In this chapter the authors introduce context-free grammars, and they explain grammars for expressions.
Wolfgang J. Paul +3 more
openaire +1 more source
In this chapter the authors introduce context-free grammars, and they explain grammars for expressions.
Wolfgang J. Paul +3 more
openaire +1 more source
Length Synchronization Context-Free Grammars
2004We propose a new type of regulation on the derivation of a context-free grammar: the productions used for passing from a level of a derivation tree to the next level should have the right-hand members of the same length. We prove that such length synchronized context-free grammars characterize the family of ET0L languages, and therefore are equivalent ...
Madhu, Mutyam, Krithivasan, Kamala
openaire +2 more sources
2011
In the compilation of source programs, the second phase of the process is the syntactical analysis. Based on the lexical analysis, the syntactical analysis checks the correctness of the source programs in terms of the grammar of the language used. And it is well-known that most of the properties of the programming languages are context-free. Therefore,
Yunlin Su, Song Y. Yan
openaire +1 more source
In the compilation of source programs, the second phase of the process is the syntactical analysis. Based on the lexical analysis, the syntactical analysis checks the correctness of the source programs in terms of the grammar of the language used. And it is well-known that most of the properties of the programming languages are context-free. Therefore,
Yunlin Su, Song Y. Yan
openaire +1 more source
1984
A context-free grammar is a collection of context-free phrase structure rules. Each such rule names a constituent type and specifies a possible expansion thereof. The standard notation is: $$ {\rm{lhs}}\,\, \to \,\,{\rm{rh}}{{\rm{s}}_{\rm{1}}}\,\,.\,\,.\,\,.\,\,{\rm{rh}}{{\rm{s}}_{\rm{n}}} $$ where lhs names the constituent, and rhs1 through ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
A context-free grammar is a collection of context-free phrase structure rules. Each such rule names a constituent type and specifies a possible expansion thereof. The standard notation is: $$ {\rm{lhs}}\,\, \to \,\,{\rm{rh}}{{\rm{s}}_{\rm{1}}}\,\,.\,\,.\,\,.\,\,{\rm{rh}}{{\rm{s}}_{\rm{n}}} $$ where lhs names the constituent, and rhs1 through ...
Alan Bundy, Lincoln Wallen
openaire +1 more source
Pullback Grammars Are Context-Free
2008Following earlier work on pullback rewriting, we describe here the notion of graph grammar relevant to our formalism. We then show that pullback grammars are context-free and provide a surprising example, namely the context-free generation of square grids.
Ly, Olivier, Chen, Rui, Bauderon, Michel
openaire +2 more sources
Attributed Context-Free Hypergraph Grammars
1998Journal of Automata, Languages and Combinatorics, Volume 3, Number 2, 1998, 105 ...
Maneth, Sebastian, Vogler, Heiko
openaire +2 more sources