Results 271 to 280 of about 262,573 (317)
Some of the next articles are maybe not open access.
Logica Universalis, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
International Journal of Foundations of Computer Science, 2015
This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings.
Zbynek Krivka, Alexander Meduna
openaire +1 more source
This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings.
Zbynek Krivka, Alexander Meduna
openaire +1 more source
Journal of the ACM, 1967
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
openaire +2 more sources
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
openaire +2 more sources
To Grammar or Not to Grammar: That Is Not the Question!
Voices from the Middle, 2001Argues that, taught in the context of writing, grammar can enhance and improve students’ writing. Offers classroom examples showing how: good preparation for writing fosters good grammar and detail; students can use grammatical and syntactic constructions used by professional authors as models for their own writing; and how to help students learn ...
Constance Weaver +2 more
openaire +1 more source
Studia Logica, 2012
The author notes that, provided that structural rules are ignored, Gentzen's sequents \(\Gamma\rightarrow A\)\ represent context-free derivations in linguistics. More generally, a derivation \(\Gamma\rightarrow\Delta\)\ stands for a rewrite rule in linguistics.
openaire +1 more source
The author notes that, provided that structural rules are ignored, Gentzen's sequents \(\Gamma\rightarrow A\)\ represent context-free derivations in linguistics. More generally, a derivation \(\Gamma\rightarrow\Delta\)\ stands for a rewrite rule in linguistics.
openaire +1 more source
2008
A Grammar of Eton is the first description of the Cameroonian Bantu language Eton. It is also one of the few complete descriptions of a North-western Bantu language. The complex tonology of Eton is carefully analysed and presented in a simple and consistent descriptive framework, which permits the reader to keep track of Eton's many tonal morphemes ...
openaire +3 more sources
A Grammar of Eton is the first description of the Cameroonian Bantu language Eton. It is also one of the few complete descriptions of a North-western Bantu language. The complex tonology of Eton is carefully analysed and presented in a simple and consistent descriptive framework, which permits the reader to keep track of Eton's many tonal morphemes ...
openaire +3 more sources
Grammar and Contrastive Grammar
1987A person who speaks a language may be said to have mastered the grammar of that language. Knowing a language can be equated with knowing its grammar. The word ‘grammar’, as used here, refers to the set of rules that the speakers of a language carry around in their heads and that they employ in producing and interpreting sentences.
Flor G. A. M. Aarts, Herman Chr. Wekker
openaire +1 more source
Apex graph grammars and attribute grammars
Acta Informatica, 1988In diesem Artikel werden die ADG Graph-Grammatiken (attribute dependency graph grammars) definiert und mit anderen Klassen von Graph-Grammatiken verglichen. Die Untersuchung ist anhand der DNLC (directed node-label controlled) Graph-Grammatiken durchgeführt, die auf dem Rewriting- Mechanismus von kontextfreien Sprachen basieren.
Joost Engelfriet +2 more
openaire +2 more sources
Grammars, 2001
In this article the author presents Peirce grammars as an alternative basis for linguistic analyses of natural languages. A Peirce grammar is a context-free grammar with a Peirce algebra as its semantics. A Peirce grammar is defined as a pair \(\langle G,F\rangle \) with \(G\) a context-free grammar and \(F\) a (partial) function \(F : P_G\to ...
openaire +1 more source
In this article the author presents Peirce grammars as an alternative basis for linguistic analyses of natural languages. A Peirce grammar is a context-free grammar with a Peirce algebra as its semantics. A Peirce grammar is defined as a pair \(\langle G,F\rangle \) with \(G\) a context-free grammar and \(F\) a (partial) function \(F : P_G\to ...
openaire +1 more source
J. Autom. Lang. Comb., 2001
This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-context-free language constructs, including those not in the intersection closure of context-free languages, and that ...
openaire +2 more sources
This paper introduces a class of formal grammars made up by augmenting the formalism of context-free grammars with an explicit set-theoretic intersection operation. It is shown that conjunctive grammars can generate some important non-context-free language constructs, including those not in the intersection closure of context-free languages, and that ...
openaire +2 more sources