3 search results - page 1 / 1 » The Copying Power of Well-nested Multiple Context-free Gramm... |
DLT
2009
13 years 3 months ago
2009
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
CL
2000
Springer
13 years 5 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...