|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
 — analysis 667—668 673—680
 -free grammar 270
-production 177 189 270
-transition 114—115 134
 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
|
|
|
| Ðåêëàìà |
|
|
|
|
|
Î ïðîåêòå