2944 search results - page 264 / 589 » On Well Quasi-orders on Languages |
177
click to vote
COLING
1996
15 years 8 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
178
click to vote
COLING
1990
15 years 7 months ago
1990
: CLG(2) is the latest member of a family of grammar formalisms centered around the notion of complex constraint expression for describing phrasal and iexical information and princ...
185
click to vote
FUIN
2008
15 years 6 months ago
2008
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
210
click to vote
ENTCS
2006
15 years 6 months ago
2006
A taxonomy of model transformations was introduced in [18]. Among others, such a taxonomy can help developers in deciding which language, forma lism, tool or mechanism is best sui...
168
click to vote
ENTCS
2006
15 years 6 months ago
2006
The LR parser generators that are bundled with many functional programming language implementations produce code that is untyped, needlessly inefficient, or both. We show that, us...