Results 41 to 50 of about 296,979 (166)
Evaluating the Impact of Source Code Parsers on ML4SE Models [PDF]
As researchers and practitioners apply Machine Learning to increasingly more software engineering problems, the approaches they use become more sophisticated. A lot of modern approaches utilize internal code structure in the form of an abstract syntax tree (AST) or its extensions: path-based representation, complex graph combining AST with additional ...
arxiv
Fast XML/HTML for Haskell: XML TypeLift [PDF]
The paper presents and compares a range of parsers with and without data mapping for conversion between XML and Haskell. The best performing parser competes favorably with the fastest tools available in other languages and is, thus, suitable for use in large-scale data analysis. The best performing parser also allows software developers of intermediate-
arxiv +1 more source
Error Reporting in Parsing Expression Grammars
Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow ...
Ierusalimschy, Roberto+3 more
core +1 more source
Matching objects without language extension [PDF]
Pattern matching is a powerful programming concept which has proven its merits in declarative programming. The absence of pattern-matching in object-oriented programming languages is felt especially when tackling source code processing problems.
Visser, Joost
core +2 more sources
Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier. The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well ...
Ahman, Danel+12 more
core +2 more sources
Parsing for agile modeling [PDF]
Agile modeling refers to a set of methods that allow for a quick initial development of an importer and its further refinement. These requirements are not met simultaneously by the current parsing technology.
Kurš, Jan
core +1 more source
Expressing disambiguation filters as combinators [PDF]
Contrarily to most conventional programming languages where certain symbols are used so as to create non-ambiguous grammars, most recent programming languages allow ambiguity. These ambiguities are solved using disambiguation rules, which dictate how the
Backus John W.+6 more
core +1 more source
Comparing and combining finite-state and context-free parsers [PDF]
In this paper, we look at comparing high-accuracy context-free parsers with high-accuracy finite-state (shallow) parsers on several shallow parsing tasks. We show that previously reported comparisons greatly under-estimated the performance of context-free parsers for these tasks.
Kristy Hollingshead+2 more
openaire +2 more sources
Improving parsing accuracy by combining diverse dependency parsers [PDF]
This paper explores the possibilities of improving parsing results by combining outputs of several parsers. To some extent, we are porting the ideas of Henderson and Brill (1999) to the world of dependency structures. We differ from them in exploring context features more deeply.
Zdenėk Żabokrtsk'y, Daniel Zeman
openaire +2 more sources
An implementation of combined partial parser and morphosyntactic disambiguator [PDF]
The aim of this paper is to present a simple yet efficient implementation of a tool for simultaneous rule-based morphosyntactic tagging and partial parsing formalism. The parser is currently used for creating a tree-bank of partial parses in a valency acquisition project over the IPI PAN Corpus of Polish.
openaire +2 more sources