Results 1 to 10 of about 341,079 (230)

YooccLa: a parser generator for L-attributed grammars [PDF]

open access: greenProceedings 37th International Conference on Technology of Object-Oriented Languages and Systems. TOOLS-Pacific 2000, 2002
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

What Did(n’t) Happen to English?: A Re-evaluation of Some Contact Explanations in Early English

open access: yesSELIM. Journal of the Spanish Society for Medieval English Language and Literature., 2023
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

Growth grammars simulating trees – an extension of L-systems incorporating local variables and sensitivity.

open access: yesSilva Fennica, 1997
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   +1 more source

Statistical Relational Learning of Grammar Rules for 3D Building Reconstruction

open access: yesTrans. GIS, 2017
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

open access: yesInternational Conference on Computational Linguistics, 1988
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]

open access: yesAAAI Conference on Artificial Intelligence, 2020
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

An approximate matching algorithm for finding (sub-)optimal sequences in S-attributed grammars

open access: yesEuropean Conference on Computational Biology, 2002
MOTIVATION S-attributed grammars (a generalization of classical Context-Free grammars) provide a versatile formalism for sequence analysis which allows to express long range constraints: the RNA folding problem is a typical example of application ...
J. Waldispühl, B. Behzadi, J. Steyaert
semanticscholar   +1 more source

Automated program recognition by graph parsing

open access: yes, 1992
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

Social Media Exposure and Grammar Proficiency of Junior High School Students’: A Correlational Study

open access: yesInternational Journal of Multidisciplinary Applied Business and Education Research, 2023
Social media has emerged as a contemporary form of media with diverse attributes and characteristics. It serves as a means of instruction, and the younger generation frequently engages with it for various social interactions and communication purposes ...
Jennen Otibar   +7 more
semanticscholar   +1 more source

On syntax-directed adjoint fortran code

open access: yesComputer Science and Information Systems, 2007
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

Home - About - Disclaimer - Privacy