Results 211 to 220 of about 1,698 (255)
Some of the next articles are maybe not open access.
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
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
1993
Context-free grammars are a language for defining languages. Not all languages can be defined by a context-free grammar — only the (yes) context-free ones. Suppose we want to define the language of a small child, who continually says sentences like “want cookie”. His or her sentences consist of a verb followed by a noun.
openaire +1 more source
Context-free grammars are a language for defining languages. Not all languages can be defined by a context-free grammar — only the (yes) context-free ones. Suppose we want to define the language of a small child, who continually says sentences like “want cookie”. His or her sentences consist of a verb followed by a noun.
openaire +1 more source
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 +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
TABLE-DRIVEN CONTEXT-FREE PICTURE GRAMMARS
International Journal of Foundations of Computer Science, 2007Random context picture grammars (rcpgs) are a method of syntactic picture generation. The productions of such a grammar are context-free, but their application is regulated—permitted or forbidden—by context randomly distributed in the developing picture.
Bhika, Charita +3 more
openaire +2 more sources
Spinal-Formed Context-Free Tree Grammars
Theory of Computing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujiyoshi, A., Kasai, T.
openaire +2 more sources
CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS
International Journal of Foundations of Computer Science, 2007We introduce a new type of finite copying parallel rewriting system, i. e., grammars with linked nonterminals, which extend the generative capacity of context-free grammars. They can be thought of as having sentential forms where some instances of a nonterminal may be linked.
Klein, Andreas, Kutrib, Martin
openaire +2 more sources
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