Descriptional Complexity of Context-Free Grammar Forms

  title={Descriptional Complexity of Context-Free Grammar Forms},
  author={Erzs{\'e}bet Csuhaj-Varj{\'u} and Alica Kelemenov{\'a}},
  journal={Theor. Comput. Sci.},

Improved Descriptional Complexity Results on Generalized Forbidding Grammars

This work studies for what sizes of generalized forbidding grammars one can obtain the computational power of Turing machines and shows that for sizes (2, 6, 8, 6), this result is specifically shown.

On automata and language based grammar metrics

The aim of this paper is to experiment, on several grammars of domain specific languages and of general-purpose languages, existing grammar metrics together with the new metrics that are based on grammar LR automaton and on the language recognized.

On defining quality based grammar metrics

The aim of this paper is to explore the meaning of grammar metrics and to experiment, on several grammars of domain specific languages and of general purpose languages, existing grammar metrics together with new metrics based on grammar LR automaton and on the produced language.

Metric-based analysis of context-free grammars

  • J.F. PowerB. Malloy
  • Computer Science
    Proceedings IWPC 2000. 8th International Workshop on Program Comprehension
  • 2000
This paper provides a foundation for the application of established software metrics to the measurement of context-free grammars, and believes that the techniques that are developed can be applied to estimating the difficulty of designing, implementing, testing and maintaining parsers for large Grammars.

A Toolkit for Generating Sentences from Context-Free Grammars

This paper presents a toolkit for context-free grammars, which mainly consists of several algorithms for sentence generation or enumeration and for coverage analysis for Context-free Grammars.

Grammar Zoo: A corpus of experimental grammarware

  • V. Zaytsev
  • Computer Science, Linguistics
    Sci. Comput. Program.
  • 2015

Goodness criteria for programming language grammar rules

This work addresses the problem of grammar rule selection when they are inferred using an automatic system, and proposes two rule selection criteria which are traditionally used for assessing the complexity of grammar based software.

Gramin: a system for incremental learning of programming language grammars

A programming language grammar inference system, called Gramin, which is used to infer grammar from sample programs, and employs various optimizations to make grammar inference practical in the domain of programming languages.

A metrics suite for grammar-based software

The software metrics that are commonly used to measure program complexity are adapted and applied to the measurement of the complexity of grammar-based software applications, so that the measure of complexity that the authors' metrics provide can guide maintainers in locating problematic areas in grammar- based applications.



Complexity of Normal Form Grammars

On a classification of context-free languages

The set E of strings is said to be definable (strongly definable) if there is a context-free grammar G such that E is the set of all terminal strings generated from the initial symbol (from all non­

Grammatical Levels of the Position Restricted Grammars

Structural complexity of context-free languages is studied for the description of context-free languages by position restricted grammars.

Formal languages

  • A. Salomaa
  • Computer Science
    Computer science classics
  • 1987

Grammar and L forms: An introduction

  • D. Wood
  • Linguistics
    Lecture Notes in Computer Science
  • 1980
A comparison study of context-free grammar forms for EOL and ETOL forms and their applications in education, research and teaching.

Structural complexity measures on grammar forms

  • Proc. Conf: on Automata, Lunguages and Proyramminy Systems
  • 1988