Sciweavers

675 search results - page 57 / 135
» On Compression of Parse Trees
Sort
View
COMPGEOM
1999
ACM
14 years 1 months ago
Mesh Collapse Compression
We present a novel algorithm for encoding the topology of triangular meshes. A sequence of edge contract and divide operations collapses the entire mesh into a single vertex. This ...
Martin Isenburg, Jack Snoeyink
GPCE
2005
Springer
14 years 2 months ago
Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
Martin Bravenboer, Rob Vermaas, Jurgen J. Vinju, E...
WCRE
2003
IEEE
14 years 2 months ago
RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages
In reverse engineering, parsing may be partially done to extract lightweight source models. Parsing code containing preprocessing directives, syntactical errors and embedded langu...
Mario Latendresse
EMNLP
2008
13 years 10 months ago
Forest-based Translation Rule Extraction
Translation rule extraction is a fundamental problem in machine translation, especially for linguistically syntax-based systems that need parse trees from either or both sides of ...
Haitao Mi, Liang Huang
ICFP
2006
ACM
14 years 8 months ago
biXid: a bidirectional transformation language for XML
Often, independent organizations define and advocate different XML formats for a similar purpose and, as a result, application programs need to mutually convert between such forma...
Shinya Kawanaka, Haruo Hosoya