NDLI: SuperC: parsing all of C by taming the preprocessor

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

Compiling a high-level language for GPUs: (via language support for architectures and compilers)

The implicit calculus: a new foundation for generic programming

Algorithmic profiling

Language-based control and mitigation of timing channels

Parcae: a system for flexible parallel execution

Proving acceptability properties of relaxed nondeterministic approximate programs

Sound and precise analysis of parallel programs through schedule specialization

Fast and precise hybrid type inference for JavaScript

Type-directed completion of partial expressions

Synchronising C/C++ and POWER

A compiler framework for extracting superword level parallelism

Verifying GPU kernels by test amplification

Concurrent data representation synthesis

A dynamic program analysis to find floating-point accuracy problems

Effective parallelization of loops in the presence of I/O operations

Fully automatic and precise detection of thread safety violations

Adaptive input-aware compilation for graphics engines

Deterministic parallelism via liquid effects

Understanding and detecting real-world performance bugs

Diderot: a parallel DSL for image analysis and visualization

JANUS: exploiting parallelism via hindsight

Automated error diagnosis using abductive inference

Parallelizing top-down interprocedural analyses

Race detection for web applications

Self-stabilizing Java

SuperC: parsing all of C by taming the preprocessor

Speculative separation for privatization and reductions

RockSalt: better, faster, stronger SFI for the x86

Dynamic synthesis for relaxed memory models

Chimera: hybrid program analysis for determinism

Polyhedra scanning revisited

Scalable and precise dynamic datarace detection for structured parallelism

And then there were none: a stall-free real-time garbage collector for reconfigurable hardware

Speculative linearizability

Input-sensitive profiling

Synthesising graphics card programs from DSLs

Reagents: expressing and composing fine-grained concurrency

Efficient state merging in symbolic execution

Design and implementation of sparse global analyses for C-like languages

Engage: a deployment management system

Type-directed automatic incrementalization

Test-case reduction for C compiler bugs

Dynamic trace-based analysis of vectorization potential of applications

Synthesizing software verifiers from proof rules

Automated synthesis of symbolic instruction encodings from I/O samples

Static analysis and compiler design for idempotent processing

Logical inference techniques for loop parallelization

Multicore acceleration of priority-based schedulers for concurrency bug detection

SuperC: parsing all of C by taming the preprocessor

Content Provider	ACM Digital Library
Author	Grimm, Robert Gazzillo, Paul
Abstract	C tools, such as source browsers, bug finders, and automated refactorings, need to process two languages: C itself and the preprocessor. The latter improves expressivity through file includes, macros, and static conditionals. But it operates only on tokens, making it hard to even parse both languages. This paper presents a complete, performant solution to this problem. First, a configuration-preserving preprocessor resolves includes and macros yet leaves static conditionals intact, thus preserving a program's variability. To ensure completeness, we analyze all interactions between preprocessor features and identify techniques for correctly handling them. Second, a configuration-preserving parser generates a well-formed AST with static choice nodes for conditionals. It forks new subparsers when encountering static conditionals and merges them again after the conditionals. To ensure performance, we present a simple algorithm for table-driven Fork-Merge LR parsing and four novel optimizations. We demonstrate the effectiveness of our approach on the x86 Linux kernel.
Starting Page	323
Ending Page	334
Page Count	12
File Format	PDF
ISBN	9781450312059
DOI	10.1145/2254064.2254103
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2012-06-11
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	C Fork-merge lr parsing Preprocessor Lr parsing Superc
Content Type	Text
Resource Type	Article

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

SuperC:parsing all of C by taming the preprocessor

SuperC: Parsing All of C by Taming the Preprocessor

Parsing All of C by Taming the Preprocessor

FeatureIDE: taming the preprocessor wilderness

Variability-aware parsing in the presence of lexical macros and conditional compilation

A tool for teaching LL and LR parsing algorithms

The essence of LR parsing

Unifying LL and LR parsing (1993)

Efficient tabular LR parsing (1996)

SuperC: parsing all of C by taming the preprocessor

Similar Documents

SuperC:parsing all of C by taming the preprocessor

SuperC: Parsing All of C by Taming the Preprocessor

Parsing All of C by Taming the Preprocessor

FeatureIDE: taming the preprocessor wilderness

Variability-aware parsing in the presence of lexical macros and conditional compilation

A tool for teaching LL and LR parsing algorithms

The essence of LR parsing

Unifying LL and LR parsing (1993)

Efficient tabular LR parsing (1996)

SuperC: parsing all of C by taming the preprocessor