√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Aho A.V., Sethi R., Ullman J.D. Ч Compilers: principles, techniques and tools
Aho A.V., Sethi R., Ullman J.D. Ч Compilers: principles, techniques and tools

„итать книгу
бесплатно

—качать книгу с нашего сайта нельз€

ќбсудите книгу на научном форуме



Ќашли опечатку?
¬ыделите ее мышкой и нажмите Ctrl+Enter


Ќазвание: Compilers: principles, techniques and tools

јвторы: Aho A.V., Sethi R., Ullman J.D.

јннотаци€:

This book is a descendant of Principles of Compiler Design by Alfred V. Aho and Jeffrey D. Ullman. Like its ancestor, it is intended as a text for a first course in compiler design. The emphasis is on solving problems universally encountered in designing a language translator, regardless of the source or target machine.


язык: en

–убрика: –уководства по программному обеспечению/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

√од издани€: 2002

 оличество страниц: 796

ƒобавлена в каталог: 21.04.2005

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
$T_1$Ч$T_2$ analysis      667Ч668 673Ч680
$\epsilon$-free grammar      270
$\epsilon$-production      177 189 270
$\epsilon$-transition      114Ч115 134
$\TeX$      8Ч9 16Ч17 82 731
Abel, N.E.      718
Abelson, H.      462
Absolute machine code      5 19 514Ч515
Abstract machine      62Ч63 See
Abstract syntax tree      49 See
Acceptance      115Ч116 199
Accepting state      114
Access link      398 416Ч420 423
Ackley, S. J.      157
Action table      216
Activation      389
Activation environment      457Ч458
Activation record      398Ч410 522Ч527
Activation tree      391Ч393
actual parameter      390 399
Acyclic graph      See Directed acyclic graph
Ada      343 361 363Ч364 366Ч367 411
Address descriptor      537
Address mode      18Ч19 519Ч521 579Ч580
Adjacency list      114Ч115
Adrion, W.R.      722
Advancing edge      663
Affix grammar      341
Aho, A.V.      158 181 204 277Ч278 292 392 444Ч445 462 566 572 583Ч584 587 721
Aigrain, P.      584
Algebraic transformation      532 557 566 600Ч602 739
Algol      24 68 80 82 86 157 277 428 461 512 561
Algol-68      21 386 512
Alias      648Ч660 721
Alignment, of data      399Ч400 473
Allen, F.E.      718Ч721
Alphabet      92
alternative      167
Ambiguity      30 171 174Ч175 184 191Ч192 201Ч202 229Ч230 247Ч254 261Ч264 578
Ambiguous definition      610
Ammann, U.      82 511 583 728Ч729 734Ч735
Analysis      2Ч10 See Parsing
Anderson, J.P.      583
Anderson, T.      278
Anktam, P.      719
Annotated parse tree      34 280
APL      3 387 411 694
Arden, B.W.      462
Arithmetic operator      361
Array      345 349 427
array reference      202 467 481Ч485 552Ч553 582 588 649
ASCII      59
Assembly code      4Ч5 15 17Ч19 89 515 519
assignment statement      65 467 478Ч488
Associativity      30 32 95Ч96 207 247Ч249 263Ч264 684
Attribute      11 33 87 260 280 See Lexical Syntax-directed Synthesized
Attribute grammar      280 580
Augmented dependency graph      334
Augmented grammar      222
Auslander, M.A.      546 583 719
Automatic code generator      23
Available expression      627Ч631 659Ч660 684 694
awk      83 158 724
Back edge      604 606 664
Back end      20 62
Back patching      21 500Ч506 515
Backhouse, R. C.      278 722
Backtracking      181Ч182
Backus Ч Naur form      See BNF
Backus, J.W.      2 82 157 386
Backward data-flow equations      624 699Ч702
Bail, W.G.      719
Baker, B.S.      720
Baker, T.P.      387
Banning, J.      721
Barron, D.W.      82
Barth, J.M.      721
Basic block      528Ч533 591 598Ч602 609 704 See
Basic induction variable      643
Basic symbol      95 122
Basic type      345
Bauer, A.M.      387
Bauer, R.L.      82 340 386
BCPL      511 583
Bealty, J.C.      583
Becber, R.J.      2
Begriffsschrift      462
Belady, L.A.      583
Bell, J.R.      718
Bentley, J.L.      360 462 587
Best, S.      2
Binary alphabet      92
Binding, of names      395Ч396
Birman, A.      277
BLISS      489 542 561 583 607 718Ч719 740Ч742
Block      See Basic block Block Common
Block structure      412 438Ч440
BNF      25 82 159 277
Bochmann, G.V.      341
body      See Procedure body
Boolean expression      326Ч328 488Ч497 501Ч503
Bootstrapping      725Ч729
Bottom-up parsing      41 195 290 293Ч296 308Ч316 463 See Operator Shift-reduce
Bounded context parsing      277
Boyer, R.S.      158
Branch optimization      740 742
Branquart, P.      342 512
Branstad, M.A.      722
Bratman, H.      725
break statement      621Ч623
Brooker, R.A.      340
Brooks, R.P.      725
Brosgol, B.M.      341
Brown, C.A.      341
Bruno, J.U.      566 584
Bucket      434 See
Buffer      57 62 88Ч92 129
Burst all, R.M.      385
Busam, V.A.      718
BYTE      399
C      52 104Ч105 162Ч163 326 358Ч359 364 366 396Ч398 411 414 424 442 473 482 510 542 561 589 696 725 735Ч737
CALL      See Procedure call
Call-by-address      See Call-by-reference
Call-by-location      See Call-by-reference
Call-by-name      428Ч429
Call-by-refercnce      426
Call-by-value      424Ч426 428Ч429
Calling sequence      404Ч408 507Ч508
Canonical collection of sets of items      222 224 230Ч232
Canonical derivation      169
Canonical LR parsing      230Ч236 254
Canonical LR parsing table      230Ч236
Cardelli, L.      387
Cardinael, J.-P.      342 512
Carlwright, R.      388
Carter, J.L.      718 731
Carter, L.R.      583
Cartesian product      345Ч346
Case statement      497Ч500
Cattell, R.G.G.      511 584
CDC      6600 584
CFG      See Context-free grammar
Chaitin, G.J.      546 583
Chandra, A.K.      546 583
Chang, C.H.      278
Changed variable      657Ч660
Character class      92 97 148.
Cherniavsky, J.C.      720 722
Cherry, L.L.      9 158 252 733
Child      29
Choe, K.M.      278
Chomsky normal form      276
Chomsky, N.      81
Chow, F.      583 719 721
Church, A.      387 462
Ciesinger, J.      278
Circular syntax-directed definition      287 334Ч336 340 342
Cleveland, W.S.      462
Closure      93Ч96 123
Closure, of set of hems      222Ч223 225 231Ч232
CNF      See Chomsky normal form
COBOL      731
Cocke Ч Younger Ч Kasami algorithm      160 277
Cocke, J.      160 277 546 583 718Ч721
Code Generation      15 513Ч584 736Ч737
Code hoisting      714
Code motion      596 638Ч643 710Ч711 721 742Ч743
Code optimization      14Ч15 463 472 480 513 530 554Ч557 585Ч722 738Ч740
Coercion      344 359Ч360 387
Coffman, E.G.      584
Cohen, R.      341
Coloring      See Graph coloring
Column-major form      481Ч482
comment      84Ч85
Common block      432 446Ч448 454Ч455
Common Lisp      462
Common subexpression      290 531 546 551 566 592Ч595 599Ч600 633Ч636 709 739Ч741 743.
Commutativity      96 684
Compaction, of storage      446
Compiler-compiler      22
composition      684
Compression      See Encoding of types
Concatenation      34Ч35 92Ч96 123
Concrete syntax tree      49. See also Syntax tree
Condition code      541
Conditional expression      See Boolean expression
Configuration      217
Conflict      See Disambiguation rule Reduce/reduce Shift/reduce
Confluence operator      624 680 695
Congruence closure      See Congruent nodes
Congruent nodes      385 388
Conservative approximation      611 614Ч615 630 652Ч654 659Ч660 689Ч690
Constant folding      592 59? 681Ч685 687Ч688
Context-free grammar      25Ч30 40Ч41 81Ч82 165Ч181 280. LR Operator
Context-free language      168 172Ч173 179Ч181
Contiguous evaluation      569Ч570
control flow      66Ч67 468Ч470 488Ч506 556Ч557 606 611 621 689Ч690 720
Control link      398 406Ч409 423
Control stack      393Ч394 396
Conway, M.E.      277
Conway, R.W.      164 278
Copy propagation      592 594Ч595 636Ч638
Copy rule      322Ч323 325 428Ч429
COPY statement      467 551 594
Copy-restore-linkage      427
Corasick, M.J.      158
Core, of set of items      237
Cormack, G.V.      158 387
Courcelle, B.      341
Cousot, P.      720
Cousot, R.      720
CPL      387
Cross compiler      726
Cross edge      663
Curry, H.B.      387
Cutler, D.      719
CYCLE      177
Cycle, in type graphs      358Ч359
Cycle-free grammar      270
CYK algorithm      See Cocke Ч Younger Ч Kasami algorithm
Dag      See Directed acyclic graph
Dala layout      399 473Ч474
Dangling else      174Ч175 191 201Ч202 249Ч251 263 268
Dangling reference      409 442
data area      446 454
data object      See Object
DATA statement      402Ч403
Data-flow analysis      586 60B-722
Data-flow analysis framework      681Ч694
Data-flow engine      23 690Ч694
Data-flow equation      608 624 680
Date, C.J.      4
Daussmann, M.      387
Davidson, J.W.      511 584
dead code      531 555 592 595
Debugger      406
Debugging      555. See also Symbolic debugging
declaration      269 394Ч395 473Ч478 510
Decoration      See Annotated parse tree
Deep access      423
default value      497Ч498
Definition      529 610 632
Definition-use chain      See Du-chain
Delescaille, J.-P.      342 512
Deletion, of locals      404
Delta      341
Demers, A.J.      278
Dencker, P.      158
Denotational semantics      340
Dependency graph      279Ч280 284Ч287 331Ч334
Depth, of a flow graph      664 672Ч673 716
Depth-first ordering      296 661 671Ч673
Depth-first search      660Ч664
Depth-first spanning tree      662
Depth-first traversal      36Ч37 324Ч325 393
Deransart, P.      342
DeRemer, F.      278 387
Derivation      29 167Ч171
Despeyroux, T.      388
Deterministic finite automaton      113 115Ч121 127Ч328 132Ч136 141Ч146 150 180Ч181 217 222 224Ч226
Deterministic transition diagram      100
DFA      See Deterministic finite automaton
Diagnostic      See Error message
Directed acyclic graph      290Ч293 347 464Ч466 471 546Ч554 558Ч561 582 584 598Ч602 606 705Ч708
Disambiguating rule      171 175 247Ч254 261Ч264
Disambiguation      387. See also Overloading
Display      420Ч422
Distance, between strings      155
Distributive framework      686Ч688 692
Distributivity      720
Ditzel, D.      583
Do statement      86 111Ч112
Dominator      602 639 670Ч671 721
Dominator tree      602
Downey, P.J.      388 584
Drossopoulou, S.      387
Druseikis, F.C.      162
Du-chain      632Ч633 643
Dummy argument      See Formal parameter
Durre, K.      158
Dynamic allocation      401 440Ч446
Dynamic checking      343 347
Dynamic programming      277 567Ч572 584
Dynamic scope      411 422Ч423
e-closure      118Ч119 225
Earley, J.      181 277Ч278 721
Earleys algorithm      160 277
EBCDIC      59
Edit distance      156
Efficiency      85 89 L26Ч128 144Ч146 152 240Ч244 279 360 388 433 435Ч438 451 516 618Ч620 724.
Egrep      158
ELI      387
Elshoff, J.L.      583
Emitter      67Ч68 72
Empty set      92
Empty string      27 46 92 94 96
Encoding of types      354Ч355
Engelfriel, J.      341
Englund, D.E.      718
Entry, to a loop      534
1 2 3 4
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2019
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте