DOCSLIB.ORG

GC28-8201-2 PL/I Reference Manual

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

File No. S360-29 OS GC28-8201-2 IBM Systems Reference Library IBM System/360 Operating System PL/I (F) Language Reference Manual This publication is a companion volume to IBM System/360 Operating System: PL/I (F) Programmer's Guide Form C28-6594. Together the two books form a guide to the writing and execution of PL/I programs under the control of an IBM System/360 Operating System that includes the PL/I (F) compiler. Third Edition (October, 1969) This is a major revision of, and obsoletes, Form C28-8201-1 and Technical Newsletters N33-6008, N33-6011. In addition to incorporating information from Technical Newsletters this new edition describes additional language implemented by Version 5 of the PL/I (F) Compiler. The contents of chapters 8 and 9 have been reorganized and now appear as three chapters: Chapter 8, Input and Output; Chapter 9, Stream-oriented Transmission; and Chapter 10, Record- oriented Transmission. In Chapter 11, Editing and String Handling, the section headed "The Picture Specification" has been completely rewritten. A new chapter, entitled "Optimization and Efficient Performance", has taken the place of Chapter 13 "Efficient Performance". The new chapter contains optimization information, and "Programming Techniques", previously part of the PL/I (F) Programmers Guide. Information on Data Mapping, extracted from the PL/I (F) Programmers Guide, now appears as Section K in Part II of this manual. Other changes to the text, and small changes to illustrations, are indicated by a vertical line to the left of the change; changed or added illustrations are denoted by the symbol • to the left of the caption. This edition applies to Release 18 of IBM System/360 Operating System, and to all subsequent releases until otherwise indicated in new editions or Technical Newsletters. Changes are continually made to the specification herein; before using this publication in connection with the operation of IBM systems, consult the latest IBM System/360 Bibliography SRL Newsletter, Form N20-0360, for the editions that are applicable and current. L Requests for copies of IBM publications should be made to your IBM representative or the IBM branch office serving your locality. Address comments concerning the contents of this publication to IBM United Kingdom Laboratories Ltd., Programming Publications, Hursley Park, Winchester, Hampshire, England. C Copyright International Business Machines Corporation 1966, 1967, 1968, 1969 Preface This publication is planned for use as a The TRKOFL and NCP options of the reference book by the PL/I programmer. It ENVIRONMENT attribute is not intended to be a tutorial publication, but is designed for the reader who already has a knowledge of the language • Abbreviations for the keywords BUFFERED and who requires a source of reference (BUF), EXCLUSIVE (EXCL), SEQUENTIAL material. (SEQL), and UNBUFFERED (UNBUF) It is divided into two parts. Part I The following language changes are also contains discussions of concepts of the implemented: language. Part II contains detailed rules and syntactic descriptions. • Mandatory RETURNS keyword on PROOEDURE, %PROCEDURE, and ENTRY statements of Although implementation information is function procedures when the function included, the book is not a complete value attributes are explicitly specified description of the implementation environment. In general, it contains • Removal of ABNORMAL, NORMAL, USES, and information needed in writing a program; it SETS attributes does not contain all of the information required to execute a program. For further information on executing a program refer to the publication: IBM System/360 Operating System PL/I (F) Programmer's Guide. Requisite Publication The following features, discussed in this publication, are implemented in the For information necessary to compile, fifth version of the F Compiler but are not linkage edit, and execute a program, the implemented in previous versions: reader should be familiar with the following publication: • Teleprocessing support IBM System/360 Operating System, PL/I (F) Programmer's Guide, Form C28-6594 The TRANSIENT attribute The PENDING condition Recommended Publications The G and R options of the ENVIRONMENT attribute The following publications contain other information that might be valuable to the • String-handling additions PL/I programmer or to a programmer who is learning PL/I: The TRANSLATE and VERIFY string built-in functions A PL/I Primer, Form C28-6808 The STRING pseudo-variable A Guide to PL/I for Commercial Programmers, Form C20-1651 • Adoption of halfword binary facilities for FIXED BINARY variables of precision A Guide to PL/I for FORTRAN Users, Form less than 16 C20-1637 Relaxation of REFER option restriction IBM System/360 Operating System, Queued Telecommunications Access Method • Optimization Message Processing Program Services, Form C30-2003 The ORDER and REORDER options of the PROCEDURE and BEGIN statements IBM System/360 Operating System, Queued Telecommunications Access Method • Usability improvements Message Control Program, Form O30-2005 Contents Figures Introduction PL/I is a programming language designed to PL/I is much less machine dependent than cover as wide a range of programming most commonly used programming languages. applications as possible. A basic belief In the interest of efficiency, however, underlying the design of PL/I is that certain features are provided that allow programmers have common problems, machine dependence for those cases in which regardless of the different applications complete independence would be too costly. with which they may be concerned. The variety of features provided by PL/I, as well as the simplicity of the The language also is designed to reduce concepts underlying them, demonstrate the the cost of programming, including the cost versatility of the language, its of training programmers, the cost of universality, and the ease with which debugging, and, in particular, the cost of different subsets can be defined to meet program maintenance. the needs of different users. Training programmers to use a particular language can often be expensive, Use of this Publication particularly if each programmer must be taught the entire language, even if he need use only a part of it. One of the prime This publication is designed as a reference features in the design of PL/I is book for the PL/I programmer. Its two-part modularity; in general, a programmer need format allows a presentation of the know only as much of the language as he material in such a way that references can requires to solve his problems. be found quickly, in as much or as little detail as the user needs. Another factor that contributes to Part I, "Concepts of PL/I," is composed programming cost is that a program of discussions and examples that explain frequently must be rewritten, sometimes the different features of the language and because the system under which it is used their interrelationships. To reduce the has changed, sometimes because the program need for cross references and to allow each is to be run on a new machine. It is not chapter to stand alone as a complete uncommon to find that rewriting a program reference to its subject, some information costs as much as writing it in the first is repeated from one chapter to another. place. Part I can, nevertheless, be read sequentially in its entirety. Two basic characteristics of PL/I are intended to reduce the need to rewrite Part II, "Rules and Syntactic complete programs if either the machine Descriptions," provides a quick reference environment or the application environment to specific information. It includes less changes. These characteristics are the information about interrelationships, but block structure used in the language and it is organized so that a particular its machine independence. question can be answered quickly. Part II is organized purely from a reference point A PL/I program is composed of blocks of of view; it is not intended for sequential statements called procedure blocks (or reading. procedures) and begin blocks, each of which defines a region of the program. A single For example, a programmer would read program may consist of one procedure or of Chapter 5 in Part I, "Statement several procedures and begin blocks. Classification," for information about the Either a procedure block or a begin block interactions of different statements in a can contain other blocks; a begin block program; but he would look in Section J of must be contained in a procedure block. Part II, "Statements," to find all the Each external procedure, that is, a rules for the use of a specific statement, procedure that is not contained in another its effect, options allowed, and the format procedure, is compiled separately. The in which it is written. same external procedure might be used in a number of different programs. In the same manner, he would read Consequently, a necessary change made in Chapter 4 in Part I, "Expressions and Data that one block effectively makes the change Conversion," for a discussion of the in all programs that use it. concepts of data conversion, but he would Introduction 13 use Section F of Part II, "Problem Data those features that are required for a full Conversion and Assignment," to determine explanation of the language. For example, the exact results of a particular type of references to certain parameters of the conversion. Data Definition (DD) job control language statement are essential to an explanation An explanation of the syntax language of record-oriented input and output file used in this publication to describe organization. elements of PL/I is contained in Part II, Section A, "Syntax Notation." Implementation features identified by the phrase "for System/360 implementa- tions...* apply to all implementations for IBM System/360 computers. Features Implementation Considerations identified by the phrase "for the F Compiler..." apply specifically to the IBM F Compiler under the IBM System/360 This publication reflects features of the Operating System.
Recommended publications
  • Scribble As Preprocessor

    Scribble As Preprocessor

    Scribble as Preprocessor Version 8.2.0.8 Matthew Flatt and Eli Barzilay September 25, 2021 The scribble/text and scribble/html languages act as “preprocessor” languages for generating text or HTML. These preprocessor languages use the same @ syntax as the main Scribble tool (see Scribble: The Racket Documentation Tool), but instead of working in terms of a document abstraction that can be rendered to text and HTML (and other formats), the preprocessor languages work in a way that is more specific to the target formats. 1 Contents 1 Text Generation 3 1.1 Writing Text Files . .3 1.2 Defining Functions and More . .7 1.3 Using Printouts . .9 1.4 Indentation in Preprocessed output . 11 1.5 Using External Files . 16 1.6 Text Generation Functions . 19 2 HTML Generation 23 2.1 Generating HTML Strings . 23 2.1.1 Other HTML elements . 30 2.2 Generating XML Strings . 32 2.3 HTML Resources . 36 Index 39 Index 39 2 1 Text Generation #lang scribble/text package: scribble-text-lib The scribble/text language provides everything from racket/base, racket/promise, racket/list, and racket/string, but with additions and a changed treatment of the module top level to make it suitable as for text generation or a preprocessor language: • The language uses read-syntax-inside to read the body of the module, similar to §6.7 “Document Reader”. This means that by default, all text is read in as Racket strings; and @-forms can be used to use Racket functions and expression escapes. • Values of expressions are printed with a custom output function.
  • Section “Common Predefined Macros” in the C Preprocessor

    Section “Common Predefined Macros” in the C Preprocessor

    The C Preprocessor For gcc version 12.0.0 (pre-release) (GCC) Richard M. Stallman, Zachary Weinberg Copyright c 1987-2021 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation. A copy of the license is included in the section entitled \GNU Free Documentation License". This manual contains no Invariant Sections. The Front-Cover Texts are (a) (see below), and the Back-Cover Texts are (b) (see below). (a) The FSF's Front-Cover Text is: A GNU Manual (b) The FSF's Back-Cover Text is: You have freedom to copy and modify this GNU Manual, like GNU software. Copies published by the Free Software Foundation raise funds for GNU development. i Table of Contents 1 Overview :::::::::::::::::::::::::::::::::::::::: 1 1.1 Character sets:::::::::::::::::::::::::::::::::::::::::::::::::: 1 1.2 Initial processing ::::::::::::::::::::::::::::::::::::::::::::::: 2 1.3 Tokenization ::::::::::::::::::::::::::::::::::::::::::::::::::: 4 1.4 The preprocessing language :::::::::::::::::::::::::::::::::::: 6 2 Header Files::::::::::::::::::::::::::::::::::::: 7 2.1 Include Syntax ::::::::::::::::::::::::::::::::::::::::::::::::: 7 2.2 Include Operation :::::::::::::::::::::::::::::::::::::::::::::: 8 2.3 Search Path :::::::::::::::::::::::::::::::::::::::::::::::::::: 9 2.4 Once-Only Headers::::::::::::::::::::::::::::::::::::::::::::: 9 2.5 Alternatives to Wrapper #ifndef ::::::::::::::::::::::::::::::
  • Julia: a Fresh Approach to Numerical Computing

    Julia: a Fresh Approach to Numerical Computing

    RSDG @ UCL Julia: A Fresh Approach to Numerical Computing Mosè Giordano @giordano [email protected] Knowledge Quarter Codes Tech Social October 16, 2019 Julia’s Facts v1.0.0 released in 2018 at UCL • Development started in 2009 at MIT, first • public release in 2012 Julia co-creators won the 2019 James H. • Wilkinson Prize for Numerical Software Julia adoption is growing rapidly in • numerical optimisation, differential equations, machine learning, differentiable programming It is used and taught in several universities • (https://julialang.org/teaching/) Mosè Giordano (RSDG @ UCL) Julia: A Fresh Approach to Numerical Computing October 16, 2019 2 / 29 Julia on Nature Nature 572, 141-142 (2019). doi: 10.1038/d41586-019-02310-3 Mosè Giordano (RSDG @ UCL) Julia: A Fresh Approach to Numerical Computing October 16, 2019 3 / 29 Solving the Two-Language Problem: Julia Multiple dispatch • Dynamic type system • Good performance, approaching that of statically-compiled languages • JIT-compiled scripts • User-defined types are as fast and compact as built-ins • Lisp-like macros and other metaprogramming facilities • No need to vectorise: for loops are fast • Garbage collection: no manual memory management • Interactive shell (REPL) for exploratory work • Call C and Fortran functions directly: no wrappers or special APIs • Call Python functions: use the PyCall package • Designed for parallelism and distributed computation • Mosè Giordano (RSDG @ UCL) Julia: A Fresh Approach to Numerical Computing October 16, 2019 4 / 29 Multiple Dispatch using DifferentialEquations
  • Macros & Sweet.Js

    Macros & Sweet.Js

    CS 252: Advanced Programming Language Principles Macros & Sweet.js Prof. Tom Austin San José State University Let's say we want to add classes to JavaScript… We'd like to have something like: class Person { constructor(name) { this.name = name; } say(msg) { console.log(this.name + " says: " + msg); } } But what we have to type is: function Person(name) { this.name = name; } Person.prototype.say = function(msg) { console.log(this.name + " says: " + msg); } We want to expand our code with classes to a version of JavaScript understood by the interpreter. Introducing macros… What is a macro? • Short for macroinstruction. • Rule specifies how input sequence maps to a replacement sequence. A Review of Compilers source Lexer/ tokens Parser code Tokenizer Abstract Compiler Interpreter Syntax Tree (AST) Machine code Commands Macros in C • C preprocessor • Text substitution macros –text is converted to text. • Embedded languages are similar – PHP, Ruby's erb, etc. Some variants work at the token level, but the concept is the same. expanded Pre- Lexer/ source code tokens Parser code processor Tokenizer Abstract Compiler Interpreter Syntax Tree (AST) Machine code Commands C preprocessor example #define PI 3.14159 #define SWAP(a,b) {int tmp=a;a=b;b=tmp;} int main(void) { int x=4, y=5, diam=7, circum=diam*PI; SWAP(x,y); } int main(void) { int x=4, y=5, diam=7, circum=diam*PI; SWAP(x,y); } int main(void) { int x=4, y=5, diam=7, circum=diam*3.14159; {int tmp=x;x=y;y=tmp;}; } Problems with C macros (in class) Many macro systems suffer from inadvertent variable capture.
  • PL/I for AIX: Programming Guide

    PL/I for AIX: Programming Guide

    IBM PL/I for AIX Programming Guide Ve r s i o n 2.0.0 SC18-9328-00 IBM PL/I for AIX Programming Guide Ve r s i o n 2.0.0 SC18-9328-00 Note! Before using this information and the product it supports, be sure to read the general information under “Notices” on page 309. Second Edition (June 2004) This edition applies to IBM PL/I for AIX 2.0.0, 5724-H45, and to any subsequent releases until otherwise indicated in new editions or technical newsletters. Make sure you are using the correct edition for the level of the product. Order publications through your IBM representative or the IBM branch office serving your locality. Publications are not stocked at the address below. A form for readers’ comments is provided at the back of this publication. If the form has been removed, address your comments to: IBM Corporation, Department HHX/H1 555 Bailey Ave San Jose, CA, 95141-1099 United States of America When you send information to IBM, you grant IBM a nonexclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. ©International Business Machines Corporation 1998,2004. All rights reserved. Contents Figures . vii COMPILE . .47 COPYRIGHT . .48 CURRENCY . .48 Part 1. Introducing PL/I on your DEFAULT . .48 workstation . .1 EXIT. .54 EXTRN . .54 Chapter 1. About this book . .3 FLAG . .55 FLOATINMATH. .55 Chapter 2. How to read the syntax GONUMBER . .56 GRAPHIC . .56 diagrams . .5 IMPRECISE . .56 INCAFTER . .57 Chapter 3.
  • Lecture 5: Scientific Computing Languages

    Lecture 5: Scientific Computing Languages

    Scientific Computing Languages (Lectures on High-performance Computing for Economists V) Jes´usFern´andez-Villaverde1 and Pablo Guerr´on2 September 15, 2021 1University of Pennsylvania 2Boston College Programming languages for scientific computation • General-purpose languages (GPL): 1. C++. 2. Python. • Domain-specific languages (DSL): 1. Julia. 2. R. 3. Matlab. • If you want to undertake research on computational-intensive papers, learning a GPL is probably worthwhile. • Moreover, knowing a GPL will make you a better user of a DSL. 1 C++ C/C++ • C/C++ is the infrastructure of much of the modern computing world. • If you know Unix and C/C++, you can probably master everything else easily (think of Latin and Romance languages!). • In some sense, C++ is really a \federation" of languages. • What is the difference between C and C++? • C++ introduced full OOP support. 2 C++ • General-purpose, multi-paradigm, static partially inferred typed, compiled language. • Current standard is C++20 (published in December 2020). C++23 in preview release. • Developed by Bjarne Stroustrup at Bells Labs in the early 1980s. • C++ has a more modern design and approach to programming than predecessor languages. Enormously influential in successor languages. • If you know C++, you will be able to read C legacy code without much problem. • In fact, nearly all C programs are valid C++ programs (the converse is not true). • But you should try to \think" in C++20, not in C or even in older C++ standards. 3 4 C++: advantages 1. Powerful language: you can code anything you can imagine in C++. 2. Continuously evolving but with a standard: new implementations have support for meta-programming, functional programming,..
  • Marco: Safe, Expressive Macros for Any Language*

    Marco: Safe, Expressive Macros for Any Language*

    Marco: Safe, Expressive Macros for Any Language? Byeongcheol Lee1, Robert Grimm2, Martin Hirzel3, Kathryn S. McKinley4,5 1 Gwangju Institute of Science and Technology 2 New York University 3 IBM Watson Research Center 4 Microsoft Research 5 The University of Texas at Austin Abstract. Macros improve expressiveness, concision, abstraction, and language interoperability without changing the programming language itself. They are indispensable for building increasingly prevalent mul- tilingual applications. Unfortunately, existing macro systems are well- encapsulated but unsafe (e.g., the C preprocessor) or are safe but tightly- integrated with the language implementation (e.g., Scheme macros). This paper introduces Marco, the first macro system that seeks both encap- sulation and safety. Marco is based on the observation that the macro system need not know all the syntactic and semantic rules of the tar- get language but must only directly enforce some rules, such as variable name binding. Using this observation, Marco off-loads most rule checking to unmodified target-language compilers and interpreters and thus be- comes language-scalable. We describe the Marco language, its language- independent safety analysis, and how it uses two example target-language analysis plug-ins, one for C++ and one for SQL. This approach opens the door to safe and expressive macros for any language. 1 Introduction Macros enhance programming languages without changing them. Programmers use macros to add missing language features, to improve concision and abstrac- tion, and to interoperate between different languages and with systems. With macros, programmers use concrete syntax instead of tediously futzing with ab- stract syntax trees or, worse, creating untyped and unchecked strings.
  • CSE 220: Systems Programming the Compiler and Toolchain

    CSE 220: Systems Programming the Compiler and Toolchain

    CSE 220: Systems Programming The Compiler and Toolchain Ethan Blanton Department of Computer Science and Engineering University at Buffalo Introduction The Compiler Driver Preprocessor Compiler Assembler Linker Summary References The C Toolchain The C compiler as we know it is actually many tools. This is due to: C’s particular history Common compiler design The specific design goal of compilation in parts What we actually invoke is the compiler driver. The compiler is only a single step of the multi-step process! © 2020 Ethan Blanton / CSE 220: Systems Programming Introduction The Compiler Driver Preprocessor Compiler Assembler Linker Summary References Compiling a C Program A C program consists of one or more source files. The C compiler driver passes the source code through several stages to translate it into machine code. A source file1 is sometimes called a translation unit. Each stage may be invoked individually …more later. 1Plus some other stuff © 2020 Ethan Blanton / CSE 220: Systems Programming Introduction The Compiler Driver Preprocessor Compiler Assembler Linker Summary References The Complete Toolchain Included Headers Pre- Compiled .c source CPP processed C Compiler .s assembly .i source Object Assembler Linker Executable .o file External Libraries © 2020 Ethan Blanton / CSE 220: Systems Programming Introduction The Compiler Driver Preprocessor Compiler Assembler Linker Summary References The C Compiler Driver First, we will ignore most stages of compilation. The C compiler driver can take a .c source file and produce an
  • Defining C Preprocessor Macro Libraries with Functional Programs

    Defining C Preprocessor Macro Libraries with Functional Programs

    Computing and Informatics, Vol. 35, 2016, 819{851 DEFINING C PREPROCESSOR MACRO LIBRARIES WITH FUNCTIONAL PROGRAMS Boldizs´ar Nemeth´ , M´at´e Karacsony´ Zolt´an Kelemen, M´at´e Tejfel E¨otv¨osLor´andUniversity Department of Programming Languages and Compilers H-1117 P´azm´anyP´eters´et´any1/C, Budapest, Hungary e-mail: fnboldi, kmate, kelemzol, [email protected] Abstract. The preprocessor of the C language provides a standard way to generate code at compile time. However, writing and understanding these macros is difficult. Lack of typing, statelessness and uncommon syntax are the main reasons of this difficulty. Haskell is a high-level purely functional language with expressive type system, algebraic data types and many useful language extensions. These suggest that Haskell code can be written and maintained easier than preprocessor macros. Functional languages have certain similarities to macro languages. By using these similarities this paper describes a transformation that translates lambda expres- sions into preprocessor macros. Existing compilers for functional languages gener- ate lambda expressions from the source code as an intermediate representation. As a result it is possible to write Haskell code that will be translated into preprocessor macros that manipulate source code. This may result in faster development and maintenance of complex macro metaprograms. Keywords: C preprocessor, functional programming, Haskell, program transfor- mation, transcompiler Mathematics Subject Classification 2010: 68-N15 1 INTRODUCTION Preprocessor macros are fundamental elements of the C programming language. Besides being useful to define constants and common code snippets, they also allow 820 B. N´emeth,M. Kar´acsony,Z. Kelemen, M. Tejfel developers to extend the capabilities of the language without having to change the compiler itself.
  • JTS: Tools for Implementing Domain-Specific Languages

    JTS: Tools for Implementing Domain-Specific Languages

    JTS: Tools for Implementing Domain-Specific Languages Don Batory, Bernie Lofaso, and Yannis Smaragdakis Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712 {batory, bernie, smaragd}@cs.utexas.edu Abstract1 common language constructs. Second, the extensions themselves only need to be transformed to the point where The Jakarta Tool Suite (JTS) aims to reduce substantially they are expressible in the host language. Third, existing the cost of generator development by providing domain- infrastructure (e.g., development and debugging environ- independent tools for creating domain-specific languages ments) can be reused. All these factors result into lower and component-based generators called GenVoca genera- implementation costs for language developers and tors. JTS is a set of precompiler-compiler tools for extend- decreased transition and education costs for users. ing industrial programming languages (e.g., Java) with domain-specific constructs. JTS is itself a GenVoca gener- Nevertheless, adding domain-specific constructs to a ator, where precompilers for JTS-extended languages are general programming language presents severe technical constructed from components. difficulties. Programming languages are generally not designed to be extensible, and the ones that are (e.g., Lisp and a variety of other functional languages) have not 1 Introduction gained wide acceptance. Addressing the needs of the industry (where C, C++, and Java prevail) is paramount Software generators are among the most effective for promulgating generator technology. Our interest in methods of achieving software reuse. Generators reduce DSLs comes from our work in the design and construction maintenance costs, produce more evolvable software, and of component-based generators, called GenVoca genera- provide significant increases in software productivity tors [Bat92-97].
  • Static Validation of C Preprocessor Macros Andreas SAEBJORNSEN University of California, Davis

    Static Validation of C Preprocessor Macros Andreas SAEBJORNSEN University of California, Davis

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Institutional Knowledge at Singapore Management University Singapore Management University Institutional Knowledge at Singapore Management University Research Collection School Of Information Systems School of Information Systems 11-2009 Static validation of C preprocessor macros Andreas SAEBJORNSEN University of California, Davis Lingxiao JIANG Singapore Management University, [email protected] Daniel Quinlan Lawrence Livermore National Laboratory Zhendong SU University of California, Davis DOI: https://doi.org/10.1109/ASE.2009.75 Follow this and additional works at: https://ink.library.smu.edu.sg/sis_research Part of the Software Engineering Commons Citation SAEBJORNSEN, Andreas; JIANG, Lingxiao; Quinlan, Daniel; and SU, Zhendong. Static validation of C preprocessor macros. (2009). 2009 IEEE/ACM International Conference on Automated Software Engineering: ASE 2009: Proceedings: Auckland, New Zealand, 16-20 November 2009. 149-160. Research Collection School Of Information Systems. Available at: https://ink.library.smu.edu.sg/sis_research/495 This Conference Proceeding Article is brought to you for free and open access by the School of Information Systems at Institutional Knowledge at Singapore Management University. It has been accepted for inclusion in Research Collection School Of Information Systems by an authorized administrator of Institutional Knowledge at Singapore Management University. For more information, please email [email protected]. Static Validation of C Preprocessor Macros Andreas Sæbjørnsen† Lingxiao Jiang† Daniel Quinlan‡ Zhendong Su† †University of California, Davis ‡Lawrence Livermore National Laboratory {andsebjo, jiangl, su}@cs.ucdavis.edu, [email protected] Abstract—The widely used C preprocessor (CPP) is generally CPP is widely used to make C/C++ code more man- considered a source of difficulty for understanding and main- ageable and portable through its preprocessor directives.
  • Parsing All of C by Taming the Preprocessor NYU CS Technical Report TR2011-939

    Parsing All of C by Taming the Preprocessor NYU CS Technical Report TR2011-939

    Parsing All of C by Taming the Preprocessor NYU CS Technical Report TR2011-939 Paul Gazzillo Robert Grimm New York University fgazzillo,[email protected] Abstract improve existing C code, and automated refactorings help evolve Given the continuing popularity of C for building large-scale pro- large and complex codebases. grams, such as Linux, Apache, and Bind, it is critical to provide But all these tools are considerably complicated by the fact that effective tool support, including, for example, code browsing, bug C code mixes two languages: the C language proper and the prepro- finding, and automated refactoring. Common to all such tools is cessor, which supports file inclusion (#include), conditional com- a need to parse C. But C programs contain not only the C lan- pilation (#if, #ifdef, and so on), and macro definition/expansion guage proper but also preprocessor invocations for file inclusion (#define). Preprocessor usage is pervasive [11, 32]. For example, (#include), conditional compilation (#if, #ifdef, and so on), the x86 version of the latest stable Linux kernel (2.6.39.2) depends and macro definition/expansion (#define). Worse, the preproces- on about 7,600 header files for file inclusion, 7,000 configuration sor is a textual substitution system, which is oblivious to C con- variables for conditional compilation, and 520,000 macros for code structs and operates on individual tokens. At the same time, the expansion. Preprocessor usage isn’t limited to the kernel either: The preprocessor is indispensable for improving C’s expressivity, ab- familiar stdio.h program header in Ubuntu 10.0 depends on 44 stracting over software/hardware dependencies, and deriving vari- more files with a total of 1,293 conditionals, which are nested up to ations from the same code base.