Results 21 to 30 of about 1,131 (104)
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Bernardy, Jean-Philippe, Jansson, Patrik
core +2 more sources
K-best combination of syntactic parsers [PDF]
Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 3 - EMNLP '09, 2009 In this paper, we propose a linear model-based general framework to combine k-best parse outputs from multiple parsers. The proposed framework leverages on the strengths of previous system combination and re-ranking techniques in parsing by integrating them into a linear model.
Hui Zhang +3 more
openaire +1 more source
Combining Czech Dependency Parsers [PDF]
, 2006 In this paper we describe in detail two dependency parsing techniques developed and evaluated using the Prague Dependency Treebank 2.0 Then we propose two approaches for combining various existing parsers in order to obtain better accuracy The highest parsing accuracy reported in this paper is 85.84 %, which represents 1.86 % improvement compared to ...
Tomáš Holan, Zdeněk Žabokrtský
openaire +1 more source
Error Reporting in Parsing Expression Grammars
, 2016 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
Verified Subtyping with Traits and Mixins
, 2014 Traits allow decomposing programs into smaller parts and mixins are a form of composition that resemble multiple inheritance. Unfortunately, in the presence of traits, programming languages like Scala give up on subtyping relation between objects.
Sharma, Asankhaya
core +4 more sources
Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms
, 2019 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 +3 more sources
Parsing Expression Grammars Made Practical
, 2015 Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Laurent, Nicolas, Mens, Kim
core +1 more source
On the Usability of Reactive Programming APIs: A Mixed Evaluation
Software: Practice and Experience, Volume 55, Issue 9, Page 1506-1538, September 2025.ABSTRACT Context Reactive Programming (RP) provides powerful abstractions for managing asynchronous and event‐driven behaviors, but its APIs are often perceived as complex and difficult to use, particularly due to their reliance on functional programming concepts. Objective This study investigates the usability of two prominent JavaScript RP libraries,
Carlos Zimmerle, Kiev Gama
wiley +1 more source
Efficient parsing with parser combinators
Science of Computer Programming, 2018 Parser combinators offer a universal and flexible approach to parsing. They follow the structure of an underlying grammar, are modular, well-structured, easy to maintain, and can recognize a large variety of languages including context-sensitive ones. However, these advantages introduce a noticeable performance overhead mainly because the same powerful
Jan Kurš +4 more
openaire +3 more sources
Matching objects without language extension [PDF]
, 2006 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