Results 21 to 30 of about 636 (187)

An alternative method of training probabilistic LR parsers [PDF]

open access: yesProceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04, 2004
We discuss existing approaches to train LR parsers, which have been used for statistical resolution of structural ambiguity. These approaches are nonoptimal, in the sense that a collection of probability distributions cannot be obtained. In particular, some probability distributions expressible in terms of a context-free grammar cannot be expressed in ...
M. J. NEDERHOF, SATTA, GIORGIO
openaire   +2 more sources

Lexer and Parser Generators in Scheme [PDF]

open access: yes, 2004
The implementation of a basic LEX-style lexer generator or YACC-style parser generator requires only textbook knowledge. The im-plementation of practical and useful generators that cooperate well with a specific language, however, requires more ...
Olin Shivers   +7 more
core  

A generalized LR(1) parser for extended context-free grammars [PDF]

open access: yes, 2020
Tomita's Generalized LR(1) parser (GLR) algorithm for CF grammars runs in a linear time onLR(1) grammars and degrades to a polynomial bound otherwise.
Angelo Morzenti   +3 more
core  

The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

open access: yes, 2010
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a deficiency in the state of the art of practical LR parser table generation ...
Malloy, Brian A., Denny, Joel E.
core   +1 more source

LLLR Parsing: a Combination of LL and LR Parsing [PDF]

open access: yes, 2016
A new parsing method called LLLR parsing is defined and a method for producing LLLR parsers is described. An LLLR parser uses an LL parser as its backbone and parses as much of its input string using LL parsing as possible.
Slivnik, Boštjan
core   +1 more source

From Regression to Reasoning: Predicting M&A Announcement Returns With Large Language Models

open access: yesEuropean Financial Management, EarlyView.
ABSTRACT This study investigates whether large language models (LLMs) can predict short‐term market reactions to M&A announcements. We prompt OpenAI's latest reasoning models (o3, GPT‐5, and GPT‐5.1) to forecast whether the combined market value of acquirer and target will increase or decrease, drawing on deal‐, firm‐, and macroeconomic data for large ...
Maximilian Schreiter   +2 more
wiley   +1 more source

Code generation using a backtracking LR parser

open access: yes, 1992
Although the parsing phase of the modern compiler has been automated in a machine independent fashion, the diversity of computer architectures inhibits automating the code generation phase.
King, Laurie Anne Smith
core   +1 more source

Wide-coverage deep statistical parsing using automatic dependency structure annotation [PDF]

open access: yes, 2008
A number of researchers (Lin 1995; Carroll, Briscoe, and Sanfilippo 1998; Carroll et al. 2002; Clark and Hockenmaier 2002; King et al. 2003; Preiss 2003; Kaplan et al. 2004;Miyao and Tsujii 2004) have convincingly argued for the use of dependency (rather
O'Donovan, Ruth   +6 more
core   +1 more source

Does the Phillips Curve Lie Down as We Age?

open access: yesJournal of Money, Credit and Banking, EarlyView.
Abstract Using microlevel data, we present evidence that older individuals are less willing to substitute across varieties of goods. We estimate the elasticity of substitution for different age groups and find that the youngest cohort (aged 25–34) exhibits a higher elasticity of substitution compared to the oldest group (65+).
CHADWICK CURTIS   +2 more
wiley   +1 more source

Rebalancing Software Defect Datasets via Mutation: Performance Insights From Prediction Models Based on Software Measures

open access: yesSoftware Testing, Verification and Reliability, Volume 36, Issue 5, August 2026.
A mutation‐based approach (MBA) to rebalance defect datasets improves recall, particularly in cross‐project prediction, but increases false alarms and does not consistently enhance MCC or AUC. These findings highlight both the potential and limitations of mutation‐based rebalancing in software defect prediction.
Dinçer Güner   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy