782 search results - page 27 / 157 » Can a Parser be Generated from Examples |
119
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
128
Voted
GPCE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We describe our efforts to use source-level rewriting to optimize run-time program generators written in Jumbo, a run-time program generation system for Java. Jumbo is a...
152
Voted
PPPJ
2006
ACM
15 years 9 months ago
2006
ACM
The JavaTM programming language is primarily used for platform-independent programming. Yet it also offers many productivity, maintainability and performance benefits for platfo...
144
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomi...
129
Voted
EMNLP
2009
15 years 1 months ago
2009
This paper proposes a novel method to refine the grammars in parsing by utilizing semantic knowledge from HowNet. Based on the hierarchical state-split approach, which can refine ...