Results 271 to 280 of about 176,605 (340)
Some of the next articles are maybe not open access.
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
Acta Informatica, 1994
A text is a triple \(\tau=(\lambda,\rho_ 1,\rho_ 2)\) such that \(\lambda\) is a labeling function, and \(\rho_ 1\) and \(\rho_ 2\) are linear orders on the domain of \(\lambda\); hence \(\tau\) may be seen as a word \((\lambda,\rho_ 1)\) together with an additional linear order \(\rho_ 2\) on the domain of \(\lambda\). The order \(\rho_ 2\) is used to
Ehrenfeucht, A. +2 more
openaire +2 more sources
A text is a triple \(\tau=(\lambda,\rho_ 1,\rho_ 2)\) such that \(\lambda\) is a labeling function, and \(\rho_ 1\) and \(\rho_ 2\) are linear orders on the domain of \(\lambda\); hence \(\tau\) may be seen as a word \((\lambda,\rho_ 1)\) together with an additional linear order \(\rho_ 2\) on the domain of \(\lambda\). The order \(\rho_ 2\) is used to
Ehrenfeucht, A. +2 more
openaire +2 more sources
Predictors of Context-Free Grammars
SIAM Journal on Computing, 1980A predictor of a context-free grammar G is a substring of a sentence in $L(G)$ which determines unambiguously the contents of the parse stack immediately before (in top-down parsing) or after (in bottom-up parsing) symbols of the predictor are processed.
openaire +2 more sources
A Trellis-Based Algorithm For Estimating The Parameters Of Hidden Stochastic Context-Free Grammar
Human Language Technology - The Baltic Perspectiv, 1991The paper presents a new algorithm for estimating the parameters of a hidden stochastic context-free grammar. In contrast to the Inside/Outside (I/O) algorithm it does not require the grammar to be expressed in Chomsky normal form, and thus can operate ...
J. Kupiec
semanticscholar +1 more source
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