Results 141 to 144 of about 11,962 (144)
Some of the next articles are maybe not open access.
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
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