Results 291 to 300 of about 318,670 (335)
Some of the next articles are maybe not open access.
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
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
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
Context-Free Grammars and XML Languages
2006We study the decision properties of XML languages. It was known that given a context-free language included in the Dyck language with sufficiently many pairs of parentheses, it is undecidable whether or not it is an XML language. We improve on this result by showing that the problem remains undecidable when the language is written on a unique pair of ...
A. Bertoni, C. Choffrut, B. Palano
openaire +3 more sources
Defining Contexts in Context-Free Grammars
2012Conjunctive grammars (Okhotin, 2001) are an extension of the standard context-free grammars with a conjunction operation, which maintains most of their practical properties, including many parsing algorithms. This paper introduces a further extension to the model, which is equipped with quantifiers for referring to the left context, in which the ...
M. Barash, A. Okhotin
openaire +2 more sources
1997
In chapter 5 we use finite automata for text parsing. As noted, there are rather simple structures (e.g., nested comments) that cannot be parsed with finite automata. There is a more powerful formalism called context-free grammars that is often used when finite automata are not enough.
openaire +1 more source
In chapter 5 we use finite automata for text parsing. As noted, there are rather simple structures (e.g., nested comments) that cannot be parsed with finite automata. There is a more powerful formalism called context-free grammars that is often used when finite automata are not enough.
openaire +1 more source
PUZZLE GRAMMARS AND CONTEXT-FREE ARRAY GRAMMARS
International Journal of Pattern Recognition and Artificial Intelligence, 1991We introduce a new model for generating finite, digitized, connected pictures called puzzle grammars and study its generative power by comparison with array grammars. We note how this model generalizes the classical Chomskian grammars and study the effect of direction-independent rewriting rules.
M. NIVAT +4 more
openaire +1 more source
2019
Context-free grammars represent language-generating rewriting systems. Each of their rewriting rules has a single symbol on its left-hand sides. By repeatedly applying these rules, these grammars generate sentences of their languages. This chapter gives a mathematical introduction into context-free grammars.
openaire +1 more source
Context-free grammars represent language-generating rewriting systems. Each of their rewriting rules has a single symbol on its left-hand sides. By repeatedly applying these rules, these grammars generate sentences of their languages. This chapter gives a mathematical introduction into context-free grammars.
openaire +1 more source
The Polytope of Context-Free Grammar Constraints
2009Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention in the last few years as it represents an effective and highly expressive modeling entity.
Gilles Pesant +3 more
openaire +1 more source