|
|
 |
| Àâòîðèçàöèÿ |
|
|
|
| Ïîèñê ïî óêàçàòåëÿì |
|
|
|
|
|
|
|
 |
|
|
|
| Aho A.V., Sethi R., Ullman J.D. — Compilers: principles, techniques and tools |
|
|
|
| Ïðåäìåòíûé óêàçàòåëü |
Environment 395 457—458
EQN 9—10 252—254 300 723—724 726 733—734
Equel 16
EQUIVALENCE statement 432 448—455
Equivalence, of basic blocks 530
Equivalence, of finite automata 388
Equivalence, of grammars 168
Equivalence, of regular expressions 95 150
Equivalence, of syntax-directed definitions 302—305
Equivalence, of type expressions 352—359. See also Unification
Equivalence, under a substitution 371 377—379
Error handling 11 72—73 88 161—162. Logical Semantic Syntax
error message 194 211—215 256—257
Error productions 164—165 264—266
Ershov, A.P. 341 583 718
escape character 110
Evaluation order, for basic blocks 518 558—561
Evaluation order, for syntax-directed definitions 285—287 298—299 316—336
Evaluation order, for trees 561—580
Eve, J. 278
Explicit allocation 440 443—444
Explicit type conversion 359
Expression 6—7 31—32 166 290—293 350—351.
Extended basic block 7i4
External reference 19
Fabri, J. 718
Failure function 151 154
Family, of an induction variable 644
Fang, I. 341
Farrow, R. 341—342
Feasible type 363
Feldman, S. 1 157 511 729
Ferrante, J. 718
Feys, R. 387
fgrep 158
Fibonacci string 153
Field, of a record 477—478 488
Final state See Accepting state
find 378—379
Finite automaton 113—144. See also Transition diagram
first 45—46 188—190 193
Firstpos 135 137—140
Fischer, C.N. 278 583—584
Fischer, M.J. 158 462
Fleck, A.C. 428
Flow graph 528 532—534 547 591 602.
flow of control 529. See also Control flow
Flow-of-control check 343
Floyd, R.W. 277 584
FOLDS 341
FOLLOW 188—190 193 230—231
Followpos 135 137—140
Fong, A.C. 721
Formal parameter 390
FORTRAN 2 86 111—113 157 208 386 396 401—403 427 432 446—455 481 602 718 723
Fortran H 542 583 727—728 737—740
Forward data-flow equations 624 698—702
Forward edge 606
Fosdick, L.D. 722
Foster, J.M. 82 277
Fragmentation 443—444
Frame See Activation record
Fraser, C.W. 511—512 584
Fred man, M. 158
Frege, G. 462
Freiburghouse, R.A. 512 583
Freudcnberger, S.M. 719 722
Front end 20 62
Fukuya, S. 583
Function See Procedure
Function type 346—347 352 361—364.
GAG 341—342
Gajewska, H. 721
Galler, B.A. 462
Ganapathi, M 583—584
Gannon, J.D. 163
Ganzinger, H. 341 387
Garbage collection 441—442
Garcy, M.R. 584
Gear, C.W. 720
gen 608 612—614 627 636
Generation, of a string 29
generic function 364. See also Polymorphic function
Geschke, CM. 489 543 583 718—719 740
Giegerich, R. 341 512 584
Glanville, R.S. 579 584
Global error correction 164—165
Global name 653. See also Nonlocal name
Global optimization 592 633
Global register allocation 542—546
GNF See Greibach normal form
Goldberg, R. 2
GOTO statement 506
Goto table 216
Goto, of set of items 222 224—225 231—232 239
Graham, R.M. 277 462
Graham, S.L. 278 583—534 720
Graph See Dependency graph Directed Flow Interval Reducible Register-interference Search Transition Tree Type
Graph coloring 545—546
Grau, A.A. 512
Greibach normal form 272
grep 158
Haibt, L.M. 2
Haley, C B. 278
Handle 196—198 200 205—206 210 225—226
Handle pruning 197—198
Hanson, D.R. 512
Harrison, M.A. 278
Harrison, M.C. 158
Harrison, W.H. 583 718 722
Harry, E. 341
Hash function 434—438
Hash table 498
Hashing 292—293 433 459
Hashpjw 435—437
Hatstcad, M.H. 511 727
head 604
Header 603 611 664
Heap 397 735
Heap allocation 401—402 410—411 440—446
Hecht, M.S. 718—721
Heinen, R. 719
Held, G. 16
Helsinki Language Processor See HLP
Henderson, P.B. 720
Hennessy, J.L. 583 721
Henry, R.R. 583—584
Herrick, H.L. 2
Heuft, J. 158
Hext, J.B. 387
Hierarchical analysis 5. See also Parsing
Hill, U. 512
Hindley, R 387
HLP 278 341
Hoare, C.A.R. 82 387
Hobbs, S.O. 489 511 543 583—584 718—719 740
Hoffman, C.M. 584
Hole in scope 412
Hollerith string 98
Homing, J.J. 82 163 277—278
Hopcroft, J.E. 142 157 277 292 388 392 444—445 462 584 587
HOPE 385
Hopkins, M.E. 546 583 719
Horspool, R.N.S. 158
Horwitz, L.P. 583
Huffman, D.A. 157
Hughes, R.A. 2
Hunt, G. 584
Hunt, J.W. 158
Huskcy, H.D. 511 727
| Hutt, B. 341
IBM-370 517 569 584 737 740
IBM-7090 584
Ichbiah, J.D. 277
Idempotence 96 684
Identifier 56 86—87 179
Identity function 683—684
If statement 112—113 491—493 504—505
Ikeda, K. 583
Immediate dominator 602
Immediate lcfl recursion 176
Implicit allocation 440 444—446
Implicit type conversion 359
Important stale 134
In-line expansion 428—429. See also Macro
Indexed addressing 519 540
Indirect addressing 519—520
Indirect triples 472—473
indirection 472
Induction variable 596—598 643—648 709 72! 739
Infix expression 33
Ingalls, D.H.H. 387
Ingerman, P.Z. 82
Inherited attribute 34 280 283 299 308—316 324—325 340.
initial node 532
Initial state See State
inner loop 534 605
Input symbol 114
Instance, of a polymorphic type 370
Instruction selection 516—517
Intermediate code 12—14 463—512 514 589 704. Postfix Quadruple Three-address Tree
Interpreter 3—4
Interprocedural data flow analysis 653—660
interval 664—667
Interval analysis 624 660 667 720.
Interval depth 672
Interval graph 666
Interval partition 665—666
Irons, E.T. 82 278 340
Ishihata, K. 722
Item See Kernel item LR(1) LR(0)
Iterative data-flow analysis 624—633 672—673 690—694
Iverson, K. 387
Jacobi, Ch. 82 511 734
Janas, J.M. 387
Jarvis, J.F. 83 158
Jazaycri, M. 341—342
Jensen, K. 82 511 734 745
Johnson, D.S. 584
Johnson, S.C. 4 157—158 257 278 340 354—355 383 462 511 566 572 584 731 735—737
Johnson, W.L. 157
Johnsson, R.K. 489 543 583 718—719 740
Joliat, M. 278
Jones, N.D. 341 387 718 720
Jourdan, M. 342
Joy, W.N. 278
Kaiscrwerth, M. 158
Kam, J.B. 720
Kaplan, M.A. 387 721
Karp, R.M. 388 583
Kasami, T. 160 277 720
Kastens, U. 341—342
Kasyanov, V.N. 720
Katayama, T. 342
Keizer, E.G. 511
Kennedy, K. 341—342 583 720—721
Keohanc, J. 720
Kernel item 223 242
Kernighan, B.W. 9 23 82 158 252 462 723 730 733 750
Keyword 56 86—87 430
Kicburtz, R.B. 278
Kildall, G.A. 634 680 720
kill 608 612—614 627 636
Kiyono, T. 583
Klccne closure See Closure
Klecne, S.C. 157
KMP algorithm 152
Knuih — Morris — Pratt algorithm 158. See also KMP algorithm
Knuth, D.E. 8 23—24 82 157 277 340 388 444 462 583—584 672—673 721 732
Kobky, H.G. 718 737
Komlos, J. 158
Korenjak, A.J. 277—278
Kosaraju, S.R. 720
Koskimics, K. 341
Koster, C.H.A. 341
Kou, L. 720
Kreps, P. 16
Kristenscn, B.B. 278
Kron, H. 584
Kruskal, J B 158
L-attributed definition 280 296—318 341
L-value 64—65 229 395 424—429 547
Label 66—67 467 506 515
LaLonde, W.R. 278
LALR collection of sets of items 238
LALR grammar 239
LALR parsing See Look ahead LR parsing
LALR parsing table 236—244
Lamb, D A. 584
Lambda calculus 387
Lampson, B.W. 462
Landin, P.J. 462
Langmaack, H. 512
Language 28 92 115 168 203
Lassagne, T. 584
Lastpos 135 137—140
Lattice 387
Lazy state construction 128 158
Leader 529
Leaf 29
Lecarme, O. 727
Ledgard, H.F. 388
Left associativity 30—31 207 263
Left factoring 178—179
Left leaf 561
Left recursion 47—50 71—72 176—178 182 191—192 302—305
Left-sentential form 169
Leftmost derivation 169
Leinius, R.P. 278
Lengauer, T. 721
Lesk, M.E. 157 731
Levcrett, B.W. 511 583—584
Levy, J.-J. 584
Levy, J.P. 278
Lewi, J. 342 512
Lewis, H.R. 720
Lewis, P.M. 277 341
Lex 83 105—113 128—129 148—149 158 730
Lexeme 12 54 56 61 85 430—431
Lexical analysis 5 12 26 54—60 71 83—158 160 172 261 264 738
Lexical environment 457—458
Lexical error 8R 161
Lexical scope 411—422
Lexical value 12 111 281
Library 4—5 54
Lifetime, of a temporary 480
Lifetime, of an activation 391 410
Lifetime, of an attribute 320—322 324—329
Limit flow graph 666 668
Linear analysis 4. See also Lexical analysis
LINGUIST 341—342
Link editor 19 402
Linked list 432—433 439
Lint 347
Lisp 411 440 442 461 694 725
Literal string 86
Live variable 534—535 543 551 595 599—600 631—632 642 653
LL grammar 160 162 191—192 221 270 273 277 307—308
Loader 19
local name 394—395 398—400 411
|
|
|
| Ðåêëàìà |
|
|
|
|
|
Î ïðîåêòå