Sciweavers

7 search results - page 2 / 2
» The Wadge Hierarchy of Deterministic Tree Languages
Sort
View
ICALP
2007
Springer
13 years 11 months ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
WCRE
2003
IEEE
13 years 10 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