A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. AddisonWesley Publishing Company, 1986.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[18] Ar guably, our algorithm is simpler and more practical. 4 Model of computation The model of computation assumed in this paper is a modernized version of the random access machine (RAM) Many RAM models of a similar nature have been defined in the literature, dating back to the early 1960s [1]. Our RAM model is a realistic variant of the logarithmic cost RAM [1] the model assumes constant time exact binary integer arithmetic ( x, div) bitwise operations (left shift, right shift, bitwise xor, bitwise and) and addressing operations on words of size b. Put another way, the word ....

.... of computation The model of computation assumed in this paper is a modernized version of the random access machine (RAM) Many RAM models of a similar nature have been defined in the literature, dating back to the early 1960s [1] Our RAM model is a realistic variant of the logarithmic cost RAM [1]: the model assumes constant time exact binary integer arithmetic ( x, div) bitwise operations (left shift, right shift, bitwise xor, bitwise and) and addressing operations on words of size b. Put another way, the word size of the RAM is b. We assume that numbers are of the form i j 2 b, ....

A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The sign and Analysis of Computer Algorithms. AddisonWesley Publishing Company, Inc., Reading, Massachusetts, 1974.

....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, 3. ....

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles, Techniques, and Tools. AddisonWesley Publishing Company, Reading, MA, 1986.

....#. These space problems are tackled byTemporal CSE, described next. 3. 2 Temporal Common Subexpression Elimination Common Subexpression Elimination (CSE) is an old and well known compiler optimization that eliminates redundancies by looking for identical subexpressions that compute the same value [1]. The redundancies are removed by keeping just one of the subexpressions and using its result for all the computations that need it. This could be called spatial CSE since it looks for common subexpressions within a block of code. The SA C compiler performs conventional CSE, but it also ....

....from loop fusion and Temporal CSE, the required narrowing of the source array exactly cancels the array pad that was introduced byTemporal CSE. In other words, an actual array pad is almost never needed Figure 4 shows the data ow graph that results if TCSE and Window Narrowing are ap window [3,1] A array sum reg construct array Figure 4. Dataflow graph of loop after TCSE and Window Narrowing. plied to the column sum example of section 3.2. The register is produced by the TCSE step, which in turn requires a width one array pad on the source array and a single dummy iteration at ....

A. Aho, R. Sethi, and J. Ullman. ######### ########### ########### ### #####. AddisonWesley Publishing Company, 1986.

....analysis of the design description. Figure 1 shows a simplified view of the overall system architecture. 2. 3 VHDL Analysis The goal of the algorithm is to achieve complete coverage, but for efficiency reasons we do not consider each statement separately, and we group them into basic blocks [ASUl86]: a basic block is a set of VHDL statements that are guaranteed to be executed sequentially, i.e. they reside inside a process and do not contain any intermediate entry point nor any control statement (if, case, All the operations required for code instrumentation, dependency analysis, ....

A.V. Aho, R. Sethi, J.D. Ullman, Compilers, Principles, Techniques, and Tools , AddisonWesley Publishing Company, 1986

.... some sense, this is a compilation strategy for functional languages organized around program structure: take a higher order program, remove all higher order features by closure converting it, compile it to 3 address code, and then use traditional optimization techniques, such as those described in [3]. However, Bartlett does not argue that being sensitive to program structure is essential to compiling functional languages well. He shows that Scheme C produces code which is competitive with a native code compiler for Lisp. LIAR [45] makes use of an analysis similar to Shivers control flow 0 ....

Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison--Wesley Publishing Company, 1986.

....in the construction of other interclass representations, as we shall show. 2.3 Class Control Flow Graphs Control flow graphs have long been used to represent procedures in procedural language programs. We can also use control flow graphs to represent individual class methods. A control flow graph[1] for method M contains a node for each statement in M ; edges between nodes represent flow of control between statements. Labeled edges leaving nodes associated with conditional statements represent control paths taken when the condition evaluates to the value of the edge label. The method header ....

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers, Principles, Techniques, and Tools. Addison--Wesley Publishing Company, 1986.

....OR as the merge function t. 1. To begin the process, each server fills in its primary Bloom filter P based on the objects it actually contains by setting P to the union of their hash values. 2. Each server then sends an update, an attenuated Bloom filter U , to all of its neighbors with U [1] = P and U [2: d] 0. The server then sets U last , the last update it has made, equal to U . 3. Repeat) Whenever a server S receives an update U i from its ith neighbor, it constructs a new update U = f(S; U i ) as follows: ffl Set A i = U i so that the new update is incorporated. ffl Set U ....

....= P and U [2: d] 0. The server then sets U last , the last update it has made, equal to U . 3. Repeat) Whenever a server S receives an update U i from its ith neighbor, it constructs a new update U = f(S; U i ) as follows: ffl Set A i = U i so that the new update is incorporated. ffl Set U [1] = P so that U at depth 1 is equal to S s primary filter. ffl Set U [j] F i=1: n A i [j Gamma 1] Conceptually, U at depth j 2 [2; d] is equal to the merger of each (j Gamma 1)st level from all attenuated Bloom filters possessed by S. If U 6= U last , S broadcasts U to all of its ....

[Article contains additional citation context not shown here]

Aho, A., Ravi Sethi and Jeffrey Ullman. Compilers: Principles, Techniques and Tools. Addison--Wesley Publishing Company. 1988.

....In order to prove that a problem, say Pnew, is NP complete, two things must be accomplished. First, Pnew must be shown to be solved by non deterministic Turing Machines (NDTM) of polynomial time complexity. Second, a problem Pold known to be NP complete, is polynomially transformable to Pnew [1]. The first condition is obvious, since a non deterministic algorithm needs only to guess a tier configuration set and to check in polynomial time whether or not the total cost of such configuration is within the bound of D. For the second condition, a known NP complete problem, the Knapsack ....

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, AddisonWesley Publishing Company, 1976

....David L. Hull, 7] The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [8] have been implemented by the author mainly as sets of simple awk and gawk programs [9, 10]. string eld class TSP ANNOTE Traveling Salesman Problem (TSP) Table 2.1: Queries used to extract this subbibliography from the source database. 5 6 Genetic algorithms in TSP Chapter 3 Statistical summaries This chapter gives some general statistical summaries of genetic algorithms in TSP ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....David L. Hull, 7] The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [8] have been implemented by the author mainly as sets of simple awk and gawk programs [9, 10]. string eld class IND ANNOTE India Tapan P. Bagchi AUTHOR Tapan P. Bagchi s papers Tapan P. Bagchi EDITOR Editored by Tapan P. Bagchi Table 2.1: Queries used to extract this subbibliography from the source database. 5 6 Genetic algorithms in India Chapter 3 Statistical summaries This ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [6] have been implemented by the author mainly as sets of simple awk programs [7]. string field class protein ANNOTE Proteins protein folding ANNOTE Protein folding polymer ANNOTE Polymers DNA ANNOTE DNA Table 2.1: Queries used to extract this subbibliography from the main one. 4 Chapter 3 Statistical summaries This chapter gives some general statistical summaries of ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....used in combinatorial computing. The main features are: ffl LEDA provides a sizable collection of data types and algorithms in a form which allows them to be used by non experts. This collection includes most of the data types and algorithms described in the text books of the area (e.g. [1, 11, 6]) i.e. stacks, queues, lists, sets, dictionaries, ordered sequences, partitions, priority queues, directed, undirected, and planar graphs, lines, points, planes and basic algorithms in graph and network theory and computational geometry. ffl LEDA gives a precise and readable specification for ....

A.V. Aho, J.E. Hopcroft, J.D. Ullman, Data Structures and Algorithms, AddisonWesley Publishing Company, 1983

....can produce appreciable speedup in program execution time[14] Various compiler optimizations such as procedure inlining and code scheduling further increase the demand for good register allocation. Register allocation is divided into two subproblems: register spilling and register assignment[1]. First, register spilling determines which live ranges will be assigned to registers (allocated live ranges) and which live ranges will be assigned to memory (spilled live ranges) Then, register assignment maps allocated live ranges to registers so that no register contains more than one live ....

.... range analysis, that addresses the register spilling problem by splitting live ranges into partitions that can be independently and profitably allocated (or spilled) Load store ranges are computed using a standard iterative data flow analysis algorithm that is similar to live variable analysis[1]. We construct the interference graph of a program using load store ranges instead of live ranges, and use existing heuristics to spill and color the nodes of this graph. We incorporated our load store range analysis into a register allocator that uses Chaitin s graph coloring scheme[7] with ....

[Article contains additional citation context not shown here]

A. V. Aho, R. Sethi and J. D. Ullman, Compilers, Principles, Techniques, and Tools, Addison-- Wesley Publishing Company, 1986.

.... ACC = ACC A(FA ( I) 1 Occurrences without controlling loops give rise to scalarwise singleton access patterns. IF FA ( I) 2 EA THEN ACC = ACC A 0 [oe A (F A ( I) ENDIF The identification of statements that can exploit sparsity is done by means of an attribute grammar [1, 17], based on a context free grammar for assignment statements. 2 The following semantic rules are used to associate the strongest condition , constructed from guards, with each expression in a synthesized attribute nz, to indicate when the value of this expression is nonzero, under the assumption ....

.... I J 5 2I, while computation of l 4 = 5 does not require any bounds, because x Gamma y = 5 I Gamma J 5 I Gamma I. Collection C i A = f(i; t)j1 t i Gamma 5g for 15 i 100 results. More accuracy is achieved by incorporation of advanced techniques. Induction variable recognition [1] can be used to replace some complex subscripts by linear functions of loop indices, while symbolic manipulations (cf. symbolic dependence testing [23] improve computations on remaining complex subscripts. 3.4 Table Computation Computation of the inconsistency table is closely related to the ....

A.V. Aho, R. Sethi, and J.D. Ullman. Compilers Principles, Techniques and Tools. AddisonWesley publishing company, 1986.

....Section 5 summarizes the foreseen contributions of the proposed research. 1 2 Background 2. 1 Instruction Level Parallelism Optimizing compilers traditionally have improved program execution speed on standard single issue sequential computers by eliminating unnecessary instruction processing [1]. Computer architectures have evolved to incorporate fine grained parallelism where four or more instructions can be executed in parallel [29, 60, 66] To discover and exploit this instruction level parallelism 1 (ILP) within a program, additional compiler optimization techniques have been ....

....techniques. 2.2 Intraprocedural Compiler Optimization Framework A compiler translates human readable source code into a file that can be understood, and thereby executed, by a computer. This translation is accomplished by passing the source code through a sequence of transformation phases [1]. The typical order of phases takes a source program as input, scans the program by identifying tokens and checking syntax, parses it into meaningful expressions held in some intermediate program representation (IR) verifies the absence of semantic and other errors in the expressions, optimizes ....

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. AddisonWesley Publishing Company, 1988.

....problems make that a given CF grammar only under very restrictive conditions can be recognized by recursive descent. The grammar presented here cleverly adheres to these so called LL(1) conditions. There is a rich literature about syntax analysis, to which we refer for further reading [WAI84] [AHO86]. The recursive descent analysis technique is much too restrictive for linguistic purposes, since it can not cope with ambiguity . A sentence is ambiguous if it can be produced from the grammar in more than one way, like the famous sentences They are flying planes and Time flies like an arrow Do ....

A.V. Aho, R.Sethi, J.D. Ullman: Compilers, Principles, Techniques and Tools. AddisonWesley Publishing Company, 1984.

....recurrences (CRs) 6] The CR based loop analysis method can be applied in the areas of ffl Program optimization. The CR framework is a firm algebraic basis for loop analysis and optimization that generalizes ad hoc compiler optimization techniques related to loop induction variable recognition [1, 2, 14, 21]. Furthermore, CR based loop analysis and optimization is 1 more powerful compared to the automatic differencing method of Haghighat [12] currently the most powerful method known. The CR loop optimization method is simple to implement in compilers and in code generators of symbolic computing ....

....c 0 b 0 P m Gamman i=0 2 i = b 0 Gamma c 0 , where b 0 and c 0 are the initial values of b and c at the start of the loop. 3.2. 3 Strength Reduction Strength reduction optimization is a technique that substitutes expensive operations by semantically equivalent faster to evaluate operations [1, 2]. The CR analysis method generalizes strength reduction of polynomials, exponentials, logarithms, trigonometric functions, and factorials. Strength reduction replaces the induction variables and expressions in a loop by recurrences. For each recurrence, the template Fig. 5 is used to expand the ....

A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques and Tools. AddisonWesley Publishing Company, Reading MA, 1985.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk and gawk programs [8, 9]. string field class neural net ANNOTE Neural networks Table 2.1: Queries used to extract this subbibliography from the main database. 5 6 Genetic algorithms and neural networks Chapter 3 Statistical summaries This chapter gives some general statistical summaries of genetic algorithms and ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk and gawk programs [8, 9]. string field class robot ANNOTE Robotics robot TITLE Robotics Robot TITLE Robotics Table 2.1: Queries used to extract this subbibliography from the main database. 5 6 Genetic algorithms in robotics Chapter 3 Statistical summaries This chapter gives some general statistical summaries of ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk and gawk programs [8, 9]. string eld class AUS ANNOTE GAs by Australian researchers NZE ANNOTE GAs by New Zealandian researchers Australia JOURNAL GAs in Australian journals New Zealand JOURNAL GAs in New Zealandian journals Australia ADDRESS GAs in Australian conferences New Zealand ADDRESS GAs in New ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk and gawk programs [8, 9]. string eld class IND ANNOTE GAs in India SKO ANNOTE GAs in South Korea NKO ANNOTE GAs in North Korea TAI ANNOTE GAs in Taiwan SNG ANNOTE GAs in Singapore CHN ANNOTE GAs in China (incl. Hong Kong) CHINA China (incl. Hong Kong) HK ANNOTE China (incl. Hong Kong) IRAN ANNOTE ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk programs [8]. 4 Introduction 5 string field class Heikki Salo AUTHOR Heikki Salo Hohn AUTHOR Christian Hohn Reeves AUTHOR Colin Reeves Julstrom AUTHOR Bryant A. Julstrom Lahtinen AUTHOR Jussi Lahtinen Myllymaki AUTHOR Petri Myllymaki Silander AUTHOR Tomi Silander Tirri AUTHOR Henry Tirri Rowe ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

....Chapter 2 Introduction The table 2.1 gives the queries that have been used to extract this bibliography. The query system as well as the indexing tools used to compile this report from the BiBT E X database [7] have been implemented by the author mainly as sets of simple awk and gawk programs [8, 9]. string eld class fuzzy ANNOTE Fuzzy systems (annote) fuzzy TITLE Fuzzy systems (title) Fuzzy TITLE Fuzzy systems (title) Fuzzy JOURNAL Journal . Fuzzy . article Fuzzy BOOKTITLE Proceedings or book . Fuzzy . article Table 2.1: Queries used to extract this subbibliography ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley Publishing Company, Reading, MA, 1988.

No context found.

A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. AddisonWesley Publishing Company, 1986.

No context found.

AHO, A. V., HOPCROFT, J., AND ULLMAN, J. D. Data Structures and Algorithms, Addison -Wesley Publishing Company.

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