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

The C preprocessor is heavily used in C programs because it provides useful and even necessary additions to the C language. Since preprocessor directives are not part of C, they are removed before parsing and program analysis take place, during the phase called preprocessing. In the context

The C preprocessor is heavily used in C programs because it provides useful and even necessary additions to the C language. Since preprocessor directives are not part of C, they are removed before parsing and program analysis take place, during the phase called preprocessing. In the context

of general-purpose parsing classes + , instantiations of which represent individual grammar rules, input tokens and parsing actions. For each class, a set of operators is defined which enables the programmer to write grammar declarations in a format not unlike that for the yacc preprocessor [2]. All

Lisp has shown that a programmable syntax macro system acts as an adjunct to the compiler that gives the programmer important and powerful abstraction facilities not provided by the language. Unlike simple token substitution macros, such as are provided by CPP #the C preprocessor#, syntax macros

from exponential explosion. As part of the TypeChef project, we contribute a novel variability-aware parser that can parse almost all unpreprocessed code without heuristics in practicable time. Beyond the obvious task of detecting syntax errors, our parser paves the road for further analysis

and extending existing strategies. We have implemented a CCG parsing tool kit — ASPCCGTK — that uses ASP as its main computational means. The C&C supertagger can be used as a preprocessor within ASPCCGTK, which allows us to achieve wide-coverage natural language parsing. 1

Preprocessor conditionals are heavily used in C programs since they allow the source code to be configured for different platforms or capabilities. However, preprocessor conditionals, as well as other preprocessor directives, are not part of the C language. They need to be evaluated and removed

In a recent paper [OZ], Zhu and the present author proved that for a generic choice of tame almost complex structures J on a symplectic manifold (M 6, ω) with its first Chern class c1 = 0, any somewhere injective J-holomorphic maps ((Σ, j), u) in M are Fredholm regular and embedded on a closed

metric, that is, the gap between the undersampled channel capacity and the Nyquist-rate capacity. We investigate sampling methods that minimize the worst-case (minimax) capacity loss over all channel states. A fundamental lower bound on the minimax capacity loss is first developed, which depends only