Results 281 to 287 of about 14,474 (287)
Some of the next articles are maybe not open access.
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 +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 +1 more source
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
The Polytope of Context-Free Grammar Constraints
2009Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention in the last few years as it represents an effective and highly expressive modeling entity.
Claude-Guy Quimper +3 more
openaire +2 more sources
1997
Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph grammars. There are several types of context-free graph grammars, depending, e.g., on whether (hyper)edges or nodes are rewritten by graphs. Basic properties of the main types of context-free graph grammars are discussed.
openaire +2 more sources
Graph languages are sets of labeled graphs. They can be generated by graph grammars, and in particular by context-free graph grammars. There are several types of context-free graph grammars, depending, e.g., on whether (hyper)edges or nodes are rewritten by graphs. Basic properties of the main types of context-free graph grammars are discussed.
openaire +2 more sources
Ambiguity in context-free grammars
Proceedings of the 1995 ACM symposium on Applied computing - SAC '95, 1995openaire +2 more sources