Andrew W. Appel "Modern compiler implementation in Java", Cambridge University Press, 1998. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Rapid Prototyping of High-Performance Concurrent Java Applications - Powell (2002) (Correct)
....can be re used as is. However, as the Translator will need to create different types of objects than the Workbench (because of the its different functionality) the parser needed to be modified . The PEPA Workbench uses a Look Ahead Left Right (LALR) parser, generated by the YACC like Java CUP tool[Appel, 1998, Hudson, 1999] This helpful utility enables quick generation of Java LALR parsers. It was possible to reuse the PEPA Workbench s CUP grammar specification, specifying new actions for each rule the parser comes across. CUP was then used to generate a new parser suited to the project s needs. ....
Appel, A. W. (1998). Modern Compiler Implementation in Java. Cambridge University Press.
Reconfigurable Cryptography: A Hardware Compiler for.. - Ananian (1997) (1 citation) (Correct)
....Looping constructs are supported. The optimization phase of the compiler is designed to target hardware; for example, copy propagation is omitted because it disappears into a net list once hardware translation is complete. 4. 1 Front end The source language for the compiler is described in [App97] TIGER is a simple but non trivial language of the Algol family, lacking only the wide variety of data types that categorize more familiar languages such as C. A pre existing front end was modified to implement the bit level operations needed to support most cryptographic algorithms. ....
....this work has disovered that the OE function notation allows concise and accurate identification of state machine registers in the translation of loop constructs. This application will be further discussed in section 4.3.2. The translation into SSA form uses the algorithms discussed in [App97, C 91, LT79] The dominator tree is computed using the Lengauer Tarjan algorithm and pathcompression, and is then used to compute the dominance frontier using Cytron s twopass algorithm. After adding OE functions for the variable a at the dominance frontier of every node where a is defined, we ....
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1997.
Statically Determining Memory Consumption of Real-Time Java.. - Gheorghioiu (2002) (5 citations) (Correct)
....correspond to program variables (although there is some overlap) instead, they represent storage for intermediate values of the computation, quite similar to registers. The SSI (Single Static Information) form [4] is an extension of the more widelyused SSA (Single Static Assignment) form [5]. SSA simpli es program analysis by transferring some of the control ow information to variables; in particular, every use of a variable in the SSA form has a single reaching de nition. To accomplish this, SSA form assigns unique names to unique static values of a variable, and introduces ....
....analysis, we conservatively assume that any object returned from a method is used after the method returns. With these assumptions, a node is live at a given program point if it is pointed to by a variable that is live at that program point. Variable liveness is a well studied data ow analysis [3, 5] and we do not present it here. As a quick reminder, a variable v is live at a program point i there is a path through the control ow graph that starts at that program point, does not contain any de nition of v and ends in an instruction that uses v. It should also be noted that the SSI form ....
A. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Building a Control-flow Graph from Scheduled Assembly Code - Cooper, Harvey, Waterman (2002) (1 citation) (Correct)
....other emerging architectures, the C6000 allows branches These authors assume that the cfg is built from a wellbehaved intermediate representation that does not include branches in delay slots. Other authors simply assume that cfg construction is well understood and omit the algorithm entirely [10, 14, 2]. Some systems, such as om and alto,convertscheduled code back to a higher level representation that does not contain delay slots [20, 18] With branches in delay slots, this may not always be possible. to issue in the delay slots of other branches. Since the branch latency on the C6000 is ....
Andrew W. Appel. Modern Compiler Implementation in Java.Cambridge University Press, 1998.
Interprocedural Compatibility Analysis for Static.. - Gheorghioiu.. (2003) (6 citations) (Correct)
....to statically preallocate a xed amount of space for that allocation site, then use that space to hold all objects allocated at that site. Any further space usage analyses can then focus only on the non unitary allocation sites. Our analysis uses techniques inspired from register allocation [2, 6] to reduce the amount of memory required to hold objects allocated at unitary allocation sites. The basic approach is to build and color an incompatibility graph. The nodes in this graph are the unitary allocation sites. There is an undirected edge between two nodes if the nodes are not ....
....local variables: exceptions, iterators, string bu ers, etc. Under these assumptions, a node that does not escape into the heap is live at a given program point if and only if a variable that is live at that program point refers to that node. Variable liveness is a well studied data ow analysis [2, 6] and we do not present it here. As a quick reminder, a variable v is live at a program point if and only if there is a path through the control ow graph that starts at that program point, does not contain any de nition of v and ends at an instruction that uses v. The analysis has to process the ....
Andrew Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Building a Control-flow Graph from Scheduled Assembly Code - Cooper, Harvey, Waterman (2002) (1 citation) (Correct)
....other emerging architectures, the C6000 allows branches These authors assume that the cfg is built from a wellbehaved intermediate representation that does not include branches in delay slots. Other authors simply assume that cfg construction is well understood and omit the algorithm entirely [10, 14, 2]. Some systems, such as om and alto, convert scheduled code back to a higher level representation that does not contain delay slots [20, 18] With branches in delay slots, this may not always be possible. to issue in the delay slots of other branches. Since the branch latency on the C6000 is ....
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Unknown - (Correct)
No context found.
Andrew W. Appel "Modern compiler implementation in Java", Cambridge University Press, 1998.
On Flow-Sensitive Security Types - Sebastian Hunt Department (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, Cambridge, 1998.
Static Single Information from a Functional Perspective - Singer (2003) (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, first edition, 1998.
Flow Analysis of Metabolite Fragments for Flux - Estimation Ari Rantanen (Correct)
No context found.
Appel, A.: Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Static Single Information from a Functional Perspective - Singer (Correct)
No context found.
A. W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, first edition, 1998.
POLY Language Specification - Vieira (2002) (Correct)
No context found.
Andrew Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Displaying Linear Programs and Their Solutions With XML and SVG - Hans Chang Techbyte (Correct)
No context found.
Appel, A. W., Modern Compiler Implementation in Java, Cambridge University Press, 1998.
Basic Compiler Algorithms for Parallel Programs - Jaejin Lee And (1999) (16 citations) (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, New York, 1998.
Domain-Specific Languages in Software Development - and the.. - Christensen (2003) (1 citation) (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, Cambridge, UK, January 1998.
Safe Programming at the C Level of Abstraction - Grossman (2003) (Correct)
No context found.
Andrew Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Object-Oriented Software Specification in Programming.. - Bryant, Vaidyanathan (Correct)
No context found.
A. W. Appel. Modern Compiler Implementation in Java. Cambridge Univ. Press, 1998.
XOgastan: XML-Oriented gcc AST Analysis and Transformations - Antoniol Di Penta (2003) (Correct)
No context found.
A. W. Appel, Modern Compiler Implementation in Java. Cambrige University Press, 1998.
YAAB (Yet Another AST Browser): Using OCL to navigate ASTs - Antoniol Di Penta (2003) (Correct)
No context found.
A. W. Appel, Modern Compiler Implementation in Java. Cambrige University Press, 1998.
Building a Control-flow Graph from Scheduled Assembly Code - Cooper, Harvey, Waterman (2002) (1 citation) (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
XQuery Query Processing in Relational Systems - Chen (2004) (Correct)
No context found.
A. W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1999.
Generalized Systematic Debugging for Attribute Grammars - Sasaki, Sassa (2003) (Correct)
No context found.
Appel, A. W.: Modern Compiler Implementation in Java (1st ed.), Cambridge University Press (1998).
The Static Single Information Form - Ananian (1999) (1 citation) (Correct)
No context found.
A. W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
Coordinated Distributed Diagram Transformation for.. - Bottoni.. (2002) (3 citations) (Correct)
No context found.
Appel, A. W., \Modern Compiler Implementation in Java," Cambridge University Press, 1998.
Static Single Information Form - Ananian, Rinard (1999) (1 citation) (Correct)
No context found.
Andrew W. Appel. Modern Compiler Implementation in Java. Cambridge University Press, 1998.
First 50 documents Next 50
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