Facilitating the Definition of Programming Languages by Using Parametric Context-Free Grammars

doi 10.1142/9789812793928_0023
Full Text
Abstract

Available in full text

Date
Authors
Publisher

WORLD SCIENTIFIC

Related search

Computing Grammars and Context-Sensitive Languages

RAIRO. Informatique théorique
1978English

Analyzing Ambiguity of Context-Free Grammars

BRICS Report Series
2007English

Generalized Queries on Probabilistic Context-Free Grammars

IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern RecognitionApplied MathematicsComputer VisionMathematicsComputational TheoryArtificial IntelligenceSoftware
1998English

Dynamic Compilation of Weighted Context-Free Grammars

1998English

The Equivalence of Four Extensions of Context-Free Grammars

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1994English

Tracking Down the Origins of Ambiguity in Context-Free Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Construction of Model of Quality Attributes for Formal Grammars and Programming Languages

Scientific notes of Taurida National V.I. Vernadsky University. Series: Technical Sciences
2019English

Incremental Parsing With Parallel Multiple Context-Free Grammars

2009English

Regular Description of Context-Free Graph Languages

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1996English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy