Results 311 to 320 of about 459,830 (368)
Some of the next articles are maybe not open access.
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.
Petr Horacek +2 more
openaire +2 more sources
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.
Petr Horacek +2 more
openaire +2 more sources
2016
In this chapter the authors introduce context-free grammars, and they explain grammars for expressions.
Wolfgang J. Paul +3 more
openaire +2 more sources
In this chapter the authors introduce context-free grammars, and they explain grammars for expressions.
Wolfgang J. Paul +3 more
openaire +2 more sources
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 +3 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 +2 more sources
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 +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 +2 more sources
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 +2 more sources
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 +3 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 ...
Lincoln Wallen, Alan Bundy
openaire +2 more sources
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 ...
Lincoln Wallen, Alan Bundy
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
Indexed Grammars—An Extension of Context-Free Grammars
Journal of the ACM, 1967A new type of grammar for generating formal languages, called an indexed grammar, is presented. An indexed grammar is an extension of a context-free grammar, and the class of languages generated by indexed grammars has closure properties and decidability results similar to those for context-free languages.
openaire +3 more sources