Results 261 to 270 of about 8,860,193 (293)
Some of the next articles are maybe not open access.
On a Construction of Context-free Grammars
Fundamenta Informaticae, 2000The grammatical inference problem is solved for the class of context-free languages. A context-free language is supposed to be given by means of all its strings. Considering all strings of length bounded by k, context-free grammars G_{j,k} with 1≤j<k are constructed.
openaire +3 more sources
Grammars, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 +2 more sources
Lambek grammars are context free
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, 2002Basic categorial grammars are the context-free ones. Another kind of categorial grammars was introduced by J. Lambek (1958). These grammars are based on a syntactic calculus, known as the Lambek calculus. Chomsky (1963) conjectured that these grammars are also equivalent to context-free ones.
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
Andrzej Ehrenfeucht +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
Andrzej Ehrenfeucht +2 more
openaire +2 more sources
On context-free programmed grammars
Computer Languages, 1989Abstract We develop a definition of a deterministic and decidable class of context-free programmed grammars, the SPG class. A table-driven parsing algorithm that operates in quadratic time and an algorithm to produce the parsing table from a given grammar are included.
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.
Maurice Nivat +4 more
openaire +2 more sources
Context-free grammars on trees
Proceedings of the first annual ACM symposium on Theory of computing - STOC '69, 1969In this paper we discuss still another version of indexed grammars 1 and macro grammars3,gaining some geometric intuition about the structure of these systems. An ordinary context-free grammar is a rewriting system for strings; we find that a macro grammar is a rewriting system for trees.
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.
Andreas Klein 0001, Martin Kutrib
openaire +2 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 ...
Mikhail Barash, Alexander Okhotin
openaire +3 more sources