The Equivalence of Four Extensions of Context-Free Grammars

Theory of Computing Systems - United States
doi 10.1007/bf01191624
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Analyzing Ambiguity of Context-Free Grammars

BRICS Report Series
2007English

Dynamic Compilation of Weighted Context-Free Grammars

1998English

Tracking Down the Origins of Ambiguity in Context-Free Grammars

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Generalized Queries on Probabilistic Context-Free Grammars

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

Equivalence of Algebraic Extensions

Bulletin of the American Mathematical Society
1937English

Learning Context Free Grammars With the Finite Context Property: A Correction of A. Clark’s Algorithm

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Incremental Parsing With Parallel Multiple Context-Free Grammars

2009English

Pairwise RNA Structure Comparison With Stochastic Context-Free Grammars

2001English

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

2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy