Results 1 to 10 of about 191,257 (215)
YooccLa: a parser generator for L-attributed grammars
Argues that a parser generator can be developed that: (1) can bring parser technology within the reach of more software engineers, (2) requires less knowledge of parser technology than most existing parser generators, and (3) can allow a parser to be used where a designer might otherwise have chosen a fully procedural solution.
G. Butler, C. Mingins
semanticscholar +4 more sources
The rule-based formal language of "stochastic sensitive growth grammars" was designed to describe algorithmically the changing morphology of forest trees during their lifetime under the impact of endogenous and exogenous factors, and to generate 3-D ...
Kurth, Winfried, Sloboda, Branislav
doaj +2 more sources
Reticular Chemistry: Occurrence and Taxonomy of Nets and Grammar for the Design of Frameworks
Michael O'keeffe, Omar M Yaghi
exaly +2 more sources
What Did(n’t) Happen to English?: A Re-evaluation of Some Contact Explanations in Early English
McWhorter (2002) argued that contact with Norse caused simplifications in English grammar that set English apart from other Germanic languages. This paper focuses on one of the losses McWhorter attributed to the linguistic impact of the Scandinavian ...
Cynthia L. Allen
semanticscholar +1 more source
Statistical Relational Learning of Grammar Rules for 3D Building Reconstruction
The automatic interpretation of 3D point clouds for building reconstruction is a challenging task. The interpretation process requires highly structured models representing semantics.
Y. Dehbi +4 more
semanticscholar +1 more source
Constituent Coordination in Lexical-Functional Grammar
This paper outlines a theory of constituent coordination for Lexical-Functional Grammar. On this theory LFG's flat, unstructured sets are used as the functional representation of coordinate constructions.
R. Kaplan, John T. Maxwell III
semanticscholar +1 more source
SMART: A Situation Model for Algebra Story Problems via Attributed Grammar [PDF]
Solving algebra story problems remains a challenging task in artificial intelligence, which requires a detailed understanding of real-world situations and a strong mathematical reasoning capability.
Yining Hong +5 more
semanticscholar +1 more source
Automated program recognition by graph parsing
The recognition of standard computational structures (cliches) in a program can help an experienced programmer understand the program. Based on the known relationships between the cliches, a hierarchical description of the program's design can be ...
L. Wills
semanticscholar +1 more source
On syntax-directed adjoint fortran code
Gradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code for a subset of Fortran.
U. Naumann, J. Riehme
semanticscholar +1 more source
M. Auguston +3 more
semanticscholar +1 more source

