C.N. Fischer and R.J. LeBlanc. Crafting a Compiler. Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Symbolic Implementation of the Best Transformer - Reps, Sagiv, Yorsh (2004) (12 citations) (Correct)
.... known: the predicate abstraction domain in which there is a Boolean predicate B = x = c) for each x 2 Var and each distinct constant c that appears in the program is sufficient for copy constant propagation, in which the only statements interpreted exactly are of the form x : c and x : y [12]; however, this domain is not sufficient for versions of constant propagation in which statements of the form x : a y b and x : y z are interpreted exactly [20] The Function for Predicate Abstraction Domains One of the virtues of the predicate abstraction method is that it provides a ....
C.N. Fischer and R.J. LeBlanc. Crafting a Compiler. Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA, 1988.
Using Compiler Optimization Techniques to Detect Equivalent.. - Offutt, Craft (1994) (2 citations) (Correct)
....produced from code optimizers result in equivalent programs. When an equivalent mutant satisfies a code optimization rule, algorithms can detect that the mutant is in fact equivalent. Six types of compiler optimization techniques are used, which are described in standard compiler textbooks [FL88, ASU86] These techniques are commonly used and are standard. While some more advanced methods may improve the application of some of these techniques, the techniques described in this paper seem to give the most benefit. The six techniques are: 1. Dead Code Detection, 2. Constant Propagation, ....
....depend on a data flow analysis of the program, some of the basic concepts of data flow analysis are first presented. 5 3.1 Data Flow Analysis Data flow is a well known program analysis technique used for compiler optimization and software testing. This paper uses the standard terminology [AC76, FL88] A variable is defined (a def) when it is assigned a value, e.g. it appears on the left hand side of an assignment statement. A variable is used when it appears in the right hand side of an assignment (a computation use) or in the expression of a branch statement (a predicate use) A def of a ....
[Article contains additional citation context not shown here]
Charles N. Fischer and Richard J. Leblanc. Crafting a Compiler. Benjamin/Cummings Publishing Company, Inc, Menlo Park, CA, 1988.
Analysis and Transformation of Logic Programs - Post (1994) (Correct)
....and numerous so 4 Logic Program Parsing Analysis Transformations Compiler Example Tools Parser Generator Mode Analysis Termination Analysis Type Derivation Partial Evaluators Quintus Prolog Figure 1.1: Overview of the translation process. called parser generators [Joh75, ASU85, AJ74, FJ88, Udd88, HKR90, Hor90] are available to the language designer, who rarely needs to write a parser by hand. Instead, specifications in the form of production rules, with embedded code or action routines, are fed into a parser generator which then generates the parser. The capabilities of parser ....
....and is thus able to derive mutual exclusion between userdefined procedures. 11 2. Preliminaries In order to set the stage for the following chapters, we first review some notation and concepts on parsing and logic programming. For a more extensive treatment we refer the reader to [ASU85, AJ74, FJ88] for context free grammars and parsing, and [Llo87, Apt90, CM81, SS86] for logic programming. A unifying presentation of these two fields can also be found in [DM93] 2.1 Context Free Grammars A context free grammar is a four tuple G = hV N ; V T ; S; P i. The finite disjoint sets of ....
[Article contains additional citation context not shown here]
C. N. Fischer and R. J. LeBlanc Jr. Crafting a Compiler. Benjamin-Cummings Publishing Company, Inc, 1988.
Compiling Object-Oriented Queries - Leung (1993) (Correct)
....order in which the paths appear in the query can affect the effectiveness of the memoization function. If information about the dependency relationships between the two path expressions was available, it could be used to make a better decision about whether a path should be P or P1. In compilers[5, 32], attribute grammars are used to declaratively compute and propagate information up and down abstract syntax trees. This information is then available for use during optimization and code generation. We adapt attribute grammars to our own situation by presenting a version of an attribute grammar ....
Charles N. Fischer and Jr Richard J. LeBlanc. Crafting a Compiler in C. Benjamin Cummings Publishing Company, Inc, Menlo Park, California, 1991.
Towards a Toolkit for Building Language Implementations - Fédèle, Lecarme (1992) Self-citation (Compiler) (Correct)
.... i) PushAddress(i, GlobalLevel) Error(3) e : BldlntCstExp(0) ConstantDecl(i, n, IntegerType, e, false) end = Expr(e) AddOp(op) Factor(e1) ComputeUnaryExpr(e, e1, op) ident(n:typident) terminal integer(n: integer) terminal initialize : stopsymb[1] : restartsymb[1] Depart ) stopsymb[2] lN ) restartsymb[2] Condition ) Tableslnit; BeginCode; DeclPredeflnteger( Maxint, Maxint) lnitQN(fv, nil) DeclPredefBoolean; ....
.... GlobalLevel) Error(3) e : BldlntCstExp(0) ConstantDecl(i, n, IntegerType, e, false) end = Expr(e) AddOp(op) Factor(e1) ComputeUnaryExpr(e, e1, op) ident(n:typident) terminal integer(n: integer) terminal initialize : stopsymb[1] restartsymb[1] : Depart ) stopsymb[2] lN ) restartsymb[2] Condition ) Tableslnit; BeginCode; DeclPredeflnteger( Maxint, Maxint) lnitQN(fv, nil) DeclPredefBoolean; ....
C. N. Fischer and R. J. LeBlanc Jr., Crafting a Compiler. The Benjamin/Cummings Publishing Company, Inc., California, 1988.
Automatically Detecting Equivalent Mutants and Infeasible Paths - Offutt, Pan (1997) Self-citation (Inc) (Correct)
....in the programs are used in this paper. 1. Assertions on parameter variables. These assertions usually encode preconditions. 2. Assertions on internal variables that could be derived automatically. There are known techniques for doing this, such as slicing [Wei84] and control flow analysis [FL88] Because the focus of this research was on detecting equivalent mutants, these assertions were generated by hand and inserted as assertion constraints. 3. Assertions on internal variables that could not easily be derived automatically. When Godzilla generates a constraint that contains arrays, ....
Charles N. Fischer and Richard J. Leblanc. Crafting a Compiler. Benjamin/Cummings Publishing Company, Inc, Menlo Park, CA, 1988.
Precise Interprocedural Dataflow Analysis - With Applications To (Correct)
No context found.
C.N. Fischer and R.J. LeBlanc. Crafting a Compiler. Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA, 1988.
Maximal-Munch" Tokenization in Linear Time - Thomas Reps University (Correct)
No context found.
Fischer, C.N. and LeBlanc, R.J., Crafting a Compiler, Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA (1988).
Demand Interprocedural Dataflow Analysis - Susan Horwitz Thomas (Correct)
No context found.
Fischer, C.N. and LeBlanc, R.J., Crafting a Compiler, Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA (1988).
Maximal-Munch" Tokenization in Linear Time - Thomas Reps University (Correct)
No context found.
Fischer, C.N. and LeBlanc, R.J., Crafting a Compiler, Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA (1988).
Program Analysis via Graph Reachability - Thomas Reps Computer (Correct)
No context found.
Fischer, C.N. and LeBlanc, R.J., Crafting a Compiler, Benjamin/Cummings Publishing Company, Inc., Menlo Park, CA (1988).
A Tag-Augmented Temporal Logic Checker - Kai-Hui Chang Wei-Ting (Correct)
No context found.
Charles N. Fisher and Richard J. LeBlanc, Jr., Crafting a Compiler with C, The Benjamin/Cummings Publishing Company, Inc., 1991
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC