NDLI: Linearly Ordered Attribute Grammars: with Automatic Augmenting Dependency Selection

Please wait, while we are loading the content...

Desugaring in Practice: Opportunities and Challenges

Imperative Polymorphism by Store-Based Types as Abstract Interpretations

Structurally Heterogeneous Source Code Examples from Unstructured Knowledge Sources

Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain

Verifying Relational Properties of Functional Programs by First-Order Refinement

SWIN: Towards Type-Safe Java Program Adaptation between APIs

Safe Concurrency Introduction through Slicing

Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics

Object-sensitive Type Analysis of PHP

Incremental Evaluation of Higher Order Attributes

Threads as Resource for Concurrency Verification

Static Backward Demand-Driven Slicing

Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement

Linearly Ordered Attribute Grammars: with Automatic Augmenting Dependency Selection

Constraint Specialisation in Horn Clause Verification

Linearly Ordered Attribute Grammars: with Automatic Augmenting Dependency Selection

Content Provider	ACM Digital Library
Author	van Binsbergen, L. Thomas Bransen, Jeroen Dijkstra, Atze
Abstract	Attribute Grammars (AGs) extend Context-Free Grammars with attributes: information gathered on the syntax tree that adds semantics to the syntax. AGs are very well suited for describing static analyses, code-generation and other phases incorporated in a compiler. AGs are divided into classes based on the nature of the dependencies between the attributes. In this paper we examine the class of Linearly Ordered Attribute Grammars (LOAGs), for which strict, bounded size evaluators can be generated. Deciding whether an Attribute Grammar is linearly ordered is an NP-hard problem. The Ordered Attribute Grammars form a subclass of LOAG for which membership is tested in polynomial time by Kastens' algorithm (1980). On top of this algorithm we apply an augmenting dependency selection algorithm, allowing it to determine membership for the class LOAG. Although the worst-case complexity of our algorithm is exponential, the algorithm turns out to be efficient for practical full-sized AGs. As a result, we can compile the main AG of the Utrecht Haskell Compiler without the manual addition of augmenting dependencies. The reader is provided with insight in the difficulty of deciding whether an AG is linearly ordered, what optimistic choice is made by Kastens' algorithm and how augmenting dependencies can resolve these difficulties.
Starting Page	49
Ending Page	60
Page Count	12
File Format	PDF
ISBN	9781450332972
DOI	10.1145/2678015.2682543
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2015-01-13
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Augmenting dependencies Attribute grammars Semantics Linearly ordered attribute grammars Ordered attribute grammars Kastens' algorithm Compilers Utrecht haskell compiler
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in