Recovering grammar relationships for the Java Language Specification

Grammar convergence is a method that helps in discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Software quality journal Ročník 19; číslo 2; s. 333 - 378
Hlavní autoři: Lämmel, Ralf, Zaytsev, Vadim
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.06.2011
Springer Nature B.V
Springer Verlag
Témata:
Analysis
Asymmetry
Automation
Compilers
Computation and Language
Computer Science
Convergence
Data Structures and Information Theory
Documentation
Engineering
Evolution
Grammar
Grammars
Inclusion
Interpreters
Java
Java (programming language)
Language
Operating Systems
Operators
Programming Languages
Readability
Representations
Software
Software engineering
Software Engineering/Programming and Operating Systems
Specifications
Studies
Transformations
Grammar convergence
Grammar transformation
Language documentation
Grammar recovery
Grammar extraction
ISSN:0963-9314, 1573-1367
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Grammar convergence is a method that helps in discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for convergence, they are transformed until they are structurally equal. The transformations are composed from primitive operators; properties of these operators and the composed chains provide quantitative and qualitative insight into the relationships between the grammars at hand. We describe a refined method for grammar convergence, and we use it in a major study, where we recover the relationships between all the grammars that occur in the different versions of the Java Language Specification (JLS). The relationships are represented as grammar transformation chains that capture all accidental or intended differences between the JLS grammars. This method is mechanized and driven by nominal and structural differences between pairs of grammars that are subject to asymmetric, binary convergence steps. We present the underlying operator suite for grammar transformation in detail, and we illustrate the suite with many examples of transformations on the JLS grammars. We also describe the extraction effort, which was needed to make the JLS grammars amenable to automated processing. We include substantial metadata about the convergence process for the JLS so that the effort becomes reproducible and transparent.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0963-9314
1573-1367
DOI:10.1007/s11219-010-9116-5