Results 31 to 40 of about 163,441 (217)
Incremental Parser Generation for Tree Adjoining Grammars
, 1998 This paper describes the incremental generation of parse tables for the LR-type parsing of Tree Adjoining Languages (TALs). The algorithm presented handles modifications to the input grammar by updating the parser generated so far.
Sarkar, Anoop
core +1 more source
On the Relation between Context-Free Grammars and Parsing Expression Grammars [PDF]
, 2014 Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually presented through formalisms that hinder a proper comparison.
Ierusalimschy, Roberto +2 more
core +1 more source
An Efficient Implementation of the Head-Corner Parser [PDF]
, 1996 This paper describes an efficient and robust implementation of a bi-directional, head-driven parser for constraint-based grammars. This parser is developed for the OVIS system: a Dutch spoken dialogue system in which information about public transport ...
van Noord, Gertjan
core +10 more sources
Advanced Science, EarlyView.In superficial second‐degree burn wounds, Gb3 turns on genes related to papillary cells through the FGF2 signaling pathway. This increases the ability of cells to break down fibrin and decreases fibrosis, which ultimately prevents scar formation in burn injuries.
Sujie Xie +13 more
wiley +1 more source
Extending lookahead for LR parsers
Journal of Computer and System Sciences, 1981 AbstractA practical method is presented for extending the lookahead of LR parsers, by the addition of “reduce-arcs.” Applied to an LR(0) parser, this gives a machine which is close in size to the corresponding LALR(1) machine, but is capable of making use of unbounded lookahead.
openaire +2 more sources
Batteries &Supercaps, EarlyView.This study presents a comprehensive validation of the robotic battery materials research platform Aurora, automating electrolyte formulation, coin cell assembly, and coin cell cycling. A large, structured dataset with ontologized metadata detailing cell assembly and cycling protocols, alongside corresponding time series cycling data for NMC||graphite ...
Enea Svaluto‐Ferro +11 more
wiley +1 more source
Automata library - LR parser construction [PDF]
, 2016 Předmětem této práce jsou základní LR parsovací algoritmy. Práce v úvodu popisuje obecně bottom-up a shift-reduce parsování. Dále se zaměřuje na LR parsování, specificky LR(0) a SLR(1) parsery.
Kočička Martin
core
The Different Sources of Intergenerational Income Mobility in High‐ and Low‐Income Families
Journal of Applied Econometrics, EarlyView.ABSTRACT This paper studies intergenerational income mobility using register data for 630,000 Danish children and their parents. We document substantial mobility differences across parents' income levels. Decomposing the mobility estimates shows that for children from low‐income families, intergenerational income persistence is exclusively explained by
Anders Hjorth‐Trolle, Rasmus Landersø
wiley +1 more source
Family Firms' Boards: Reflections Based on Theoretical Groundings
Strategic Change, EarlyView.ABSTRACT Boards of Directors is one of the most recurring topics in corporate governance literature. In the family firm realm, Boards of Directors have distinctive features compared to non‐family firms; their functions and activities can differ significantly.
Andrea Sangermano +2 more
wiley +1 more source
The Lane Table Method Of Constructing LR(1) Parsers [PDF]
, 2009 The first practical application of the LR algorithm was by [1] for the LALR(1) subset of LR(1) grammars. In [2] an efficient method of producing an LR(1) parser for all LR(1) grammars was described which involves resolving conflicts at states of the LR(0)
Pager, D.
core