Search results

called positive range concatenation grammars, and reciprocally. Though intended as a variant on Groenink's literal movement grammars (LMGs), RCGs treat...

phrase structure grammar to refer to context-free grammars, whereby phrase-structure grammars are distinct from dependency grammars. In computer science...

terminal and nonterminal symbols. Context-sensitive grammars are more general than context-free grammars, in the sense that there are languages that can be...

It was published in 2001 that PTIME corresponds to (positive) range concatenation grammars. P can also be defined as an algorithmic complexity class for...

Every mildly context-sensitive grammar formalism defines a class of mildly context-sensitive grammars (the grammars that can be specified in the formalism)...

grammars in the Chomsky hierarchy can be recursive and it is recursion that allows the production of infinite sets of words. A non-recursive grammar can...

LR(1) grammar that is not LLR. Historically, LLR grammars followed the invention of the LRR grammars. Given a regular partition a Moore machine can be...

in Saltillo, Mexico, branded as RCG Televisión Range Concatenation Grammar, a type of formal grammar Restored Church of God Revolutionary Communist Group...

literals and using string concatenation: 'I said, "This is ' + "John's" + ' apple."' Python has string literal concatenation, so consecutive string literals...

expressive than linear-indexed grammars and their weakly equivalent variant tree adjoining grammars (TAGs). Head grammar is another example of an LCFRS...

whether L1 ⊆ L2, and whether L1 = L2. Regular tree grammars are a generalization of regular word grammars. The regular tree languages are also the languages...

of their generative grammar as well as the complexity of their recognizing automaton. Context-free grammars and regular grammars provide a good compromise...

; Shamir, E. (1961), "On formal properties of simple phrase structure grammars", Zeitschrift für Phonetik, Sprachwissenschaft und Kommunikationsforschung...

closed under the following operations. Union Intersection (see picture) Concatenation Complement Kleene closure Reversal Quotient Substitution Homomorphism...

formal language over Σ. Concatenation is an important binary operation on Σ*. For any two strings s and t in Σ*, their concatenation is defined as the sequence...

above, one obtains context-free grammars in Chomsky Normal Form. The Penttonen normal form (for unrestricted grammars) is a special case where first rule...

Non-recursive Recursively enumerable Decidable Context-sensitive Positive range concatenation* Indexed* — Linear context-free rewriting language Tree-adjoining...

, S , "-" , S , term | term , S ; concatenation = ( S , factor , S , "," ? ) + ; alternation = ( S , concatenation , S , "|" ? ) + ; rhs = alternation...

compactness of grammars, but do not add expressive power. Another approach is to allow affixes to take arbitrary strings as values and allow concatenations of affixes...

language is a context-sensitive language generated by these grammars. In these grammars the "start symbol" S does not appear on the right hand side of...