Computation Sequences: A Way to Characterize Subclasses of Attribute Grammars.

DAIMI Report Series
doi 10.7146/dpb.v10i138.7946
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Aarhus University Library

Related search

Attribute Grammars as a Functional Programming Paradigm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

Relating Logic Programs and Attribute Grammars

Decision Support Systems
DevelopmentalArtsInformation SystemsEducational PsychologyHumanitiesManagementManagement Information Systems
1987English

Composable Semantics Using Higher-Order Attribute Grammars

English

Approach to Context Computation for Implicit Context-Sensitive Graph Grammars

2019English

Computation of Substring Probabilities in Stochastic Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Circularity Testing of Attribute Grammars Requires Exponential Time: A Simpler Proof

DAIMI Report Series
1980English

Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars

1993English

Top-Down Parsing With Simultaneous Evaluation of Noncircular Attribute Grammars

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
1994English

On Lucas Sequences Computation

Int'l J. of Communications, Network and System Sciences
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy