Sciweavers

3827 search results - page 149 / 766
» The Epsilon Generation Language
Sort
View
ICALP
2003
Springer
15 years 10 months ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
PEPM
1993
ACM
15 years 9 months ago
The Correctness of an Optimized Code Generation
For a functional programming language with a lazy standard semantics, we define a strictness analysis by means of abstract interpretation. Using the information from the strictne...
Torben Poort Lange
ACL
2001
15 years 6 months ago
Generating with a Grammar Based on Tree Descriptions: a Constraint-Based Approach
While the generative view of language processing builds bigger units out of smaller ones by means of rewriting steps, the axiomatic view eliminates invalid linguistic structures o...
Claire Gardent, Stefan Thater
152
Voted
ACL
1996
15 years 6 months ago
Incremental Parser Generation for Tree Adjoining Grammars
This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modi cations to the inp...
Anoop Sarkar
143
Voted
ACL
1990
15 years 6 months ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen