Àâòîðèçàöèÿ
Ïîèñê ïî óêàçàòåëÿì
Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling
Îáñóäèòå êíèãó íà íàó÷íîì ôîðóìå Íàøëè îïå÷àòêó?
Íàçâàíèå: The Theory of Parsing, Translation, and Compiling. Volume II: CompilingÀâòîðû: Aho A.V., Ullman J.D. Àííîòàöèÿ: The book, Theory of Parsing, Translation and Compiling, by Alfred V. Aho, and Jeffrey D. Ullman, is intended for a senior or graduate course in compiling theory. It is a theoretical treatment of a practical computer science subject. Since computer science is an ever changing area of study, this book emphasizes ideas, rather than specific application details. The algorithms and concepts presented in the book should survive to new generations of computer technology, programs and systems. Numerous examples are given, with specific context, rather than on the large complicated contexts normally found in implementations, even in cases where the theoretical ideas are difficult to understand in isolation.
ßçûê: Ðóáðèêà: Computer science /Ñòàòóñ ïðåäìåòíîãî óêàçàòåëÿ: Ãîòîâ óêàçàòåëü ñ íîìåðàìè ñòðàíèö ed2k: ed2k stats Ãîä èçäàíèÿ: 1973Êîëè÷åñòâî ñòðàíèö: 471Äîáàâëåíà â êàòàëîã: 09.12.2009Îïåðàöèè: Ïîëîæèòü íà ïîëêó |
Ñêîïèðîâàòü ññûëêó äëÿ ôîðóìà | Ñêîïèðîâàòü ID
Ïðåäìåòíûé óêàçàòåëü
598—600 588—597 601 613 616 (1, 0)-bounded-right-context grammar 690 699—701 708 (1, 1)-bounded-right-context grammar 429—430 448 690 701 (2, 1)-precedence grammar 426 448 666 690 702—707 Aanderaa, S.D. 34 Absolute machine code 720—721 Acceptable property 815 Acceptance 96 see Accessible configuration 583 Accessible state 117 125—126 Accumulator 65 Ackley, S.I. 263 Action function 374 392 Active variable 849 937 Adjacency matrix 47—51 Aho, A.V. 102—103 192 251 399 426 563 621 645 665 709 757 787 878 960 Algebraic law 846 867—873 910—911 Algol 198—199 234 281 489—490 501 621 Algorithm 27—36 Allard, R.W. 906 Allen, F.E. 936 960 Alphabet 15 Alternates (for a nonterminal) 285 457 Ambiguous grammar 143 163 202—207 281 489—490 662—663 678 711—712 see Ancestor 39 Anderson, J.P. 906 Antisymmetric relation 10 Arbib, M.A. 138 ARC see "Edge" Arithmetic expression 86 768—773 778—781 878—907 Arithmetic progression 124 209 925—929 Assembler 59 74 Assembly language 65—70 721 863 879—880 assignment statement 65—70 Associative law 23 617 868—873 876 891 894—903 Associative tree 895—902 Asymmetric relation 9 atom 1—2 Attribute see "Inherited attribute" "Synthesized "Translation Augmented grammar 372—373 427—428 634 Automaton see "Recognizer" "Transducer" Available expression 937 Axiom 19—20 Backtrack parsing 281—314 456—500 746—753 Backus — Naur form 58 see Backus, J.W. 76 Backwards determinism see "Unique invertibility" Baer, J.L. 906 Bar-Hillel, Y. 82 102 211 Barnett, M.P. 237 Base node 39 Basic block see "Straight-line code" Bauer, F.L. 455 Bauer, H. 426 Beals, A.J. 578 Beatty, J.C. 906 Becker, S. 426 BEGIN block 913 938 Belady, L.A. 906 Bell, J.R. 563 811 Berge, C. 52 Binary search tree 792—793 Birman, A. 485 Bisection 10 Blattner, M. 211 Block see "Straight-line code" Block-structured language, bookkeeping for 792 812—813 816—821 BNF see "Backus — Naur form" Bobrow, D.G. 82 Book, R.V. 103 211 bookkeeping 59 62—63 74 255 722—723 781—782 788—843 Boolean algebra 23—24 129 Booth, T.L. 138 Border (of a sentential form) 334 369 Borodin, A. 36 Bottom-up parsing 178—184 268—271 301—307 485—500 661—662 740—742 767 816 see "Floyd-Evans "LR(k) "Precedence Bounded context grammar/language 450—452 Bounded-right-context (BR) grammar/language 427—435 448 451—452 666 699—701 708 717 see 1)-BRC "(1 0)-BRC Bovet, D.P. 966 Bracha, N. 878 Breuer, M.A. 878 Brooker, R.A. 77 313 Bruno, J.L. 787 Brzozowski, J.A. 124 138 Burkhard, W.A. 787 Busam, V.A. 936 960 Canonical collection of sets of valid items 389—391 616 621 Canonical grammar 692—697 699—700 Canonical LR(k) parser 393—396 Canonical parsing automaton 647—648 657 Canonical set of LR(k) tables 393—394 584 589—590 625 Cantor, D.G. 211 Cardinality (of a set) 11 14 Cartesian product 5 Catalan number 165 Caviar 667 Caviness, B.F. 878 CFG see "Context-free grammar" CFL see "Context-free language" Chaining 808—809 Characteristic function 34 Characteristic string (of a right sentential form) 663 Characterizing language 238—243 251 Cheatham, T.E. 58 77 280 314 579 Chen, S.C. 906 Chomsky grammar 29 see Chomsky hierarchy 92 Chomsky normal form 150—153 243 276—277 280 314 362 689 708 824 Chomsky, N. 29 58 82 102 124 166 192 211 Christensen, C. 58 Church — Turing thesis 29 Church, A. 25 29 Circuit see "Cycle" Circular translation scheme 777—778 Clark, E.R. 936 Closed portion (of a sentential form) 334—369 Closure of a language 17—18 197 Closure of a set of valid items 386 633 Closure, reflexive and transitive 8—9 Closure, transitive 8—9 47—50 52 Cluster (of a syntax tree) 894—895 CNF see "Chomsky normal form" Cocke — Younger — Kasami algorithm 281 314—320 Cocke, J. 76 332 936 960 Code Generation 59 65—70 72 74 728 765—766 781—782 863—867 see Code motion 924—925 Code optimization 59 70—72 723—724 726 769—772 844—960 Cohen, R.S. 500 Collision (in a hash table) 795—796 798—799 Colmerauer grammar 492 497—500 Colmerauer precedence relations 490—500 Colmerauer, A. 500 Column merger [in LR(k) parser] 611—612 Common subexpression see "Redundant computation" Commutative law 23 71 867 869—873 876 891—903 Compatible partition 593—596 601 627 Compile time computation 919—921 Compiler 53—57 see "Code "Code "Error "Lexical "Parsing" Compiler-compiler 77 Complementation 4 189—190 197 208 484 689 Completely specified finite automaton 117 Component grammar see "Grammar splitting" Composition (of relations) 13 250 Computation path 914—915 944 Computational complexity 27—28 208 210 297—300 316—320 326—328 356 395—396 473—476 736 839—840 863 874 944 958—959 Computed goto (in Floyd-Evans productions) 564 Concatenation 15 17 197 208—210 689 Configuration 34 95 113—114 168—169 224 228 290 303 338 477 488 582 Conflict, precedence see "Precedence conflict" Congruence relation 134 Consistent set of items 391 Constant 254 Constant propagation see "Compile time computation" Context-free grammar/language 57 91—93 97 99 101 138—211 240—242 842 Context-sensitive grammar/language 91—93 97 99 101 208 399 Continuing pushdown automaton 188—189 Conway, R.W. 77 Cook, S.A. 34 192 Core [of a set of LR(k) items] 626—627 Correspondence problem see "Post's correspondence problem" Cost criterion 844 861—863 891 Countable set 11 14 Cover, grammatical see "Left cover" "Right CSG see "Context-sensitive grammar" CSL see "Context-sensitive language" Culik, K. II 368 500 Cut (of a parse tree) 140—141 CYCLE 39 Cycle-free grammar 150 280 302—303 307 D-chart 79—82 958 Dag 39—40 42—45 116 547—549 552 763—765 854—863 865—866 959 Dangling else 202—204 data flow 937—960 Davis, M. 36 de Bakker, J.W. 878 De Morgan's laws 12 De Remer, F.L. 399 512 578 645 665 Debugging 662 Decidable problem see "Problem" Defining equations (for context-free languages) 159—163 Definition (statement of a program) 909 Denning, P.J. 426 709 Depth (in a graph) 43 Derivation 86 98 Derivation tree see "Parse tree" Derivative (of a regular expression) 136 Derived graph 940—941 Descendant 39 Deterministic finite automaton 116 255 see Deterministic finite transducer 226—227 see Deterministic language see "Deterministic pushdown automaton" Deterministic pushdown automaton 184—192 201—202 208—210 251 344 398 446 448 466—469 684—686 695 701 708—709 711 712 717 Deterministic pushdown transducer 229 251 271—275 341 395 443 446 730—736 756 Deterministic recognizer 95 see "Deterministic "Deterministic "Recognizer" Deterministic two-stack parser 488 492—493 500 Dewar, R.B.K. 77 Diagnostics see "Error correction" Difference (of sets) 4 Differentiation 760—763 Dijkstra, E.W. 79 Direct access table 791—792 Direct chaining 808 Direct dominator see "Dominator" Direct lexical analysis 61—62 258—281 Directed acyclic graph see "Dag" Directed graph see "Graph directed" Disjoint sets 4 Distance (in a graph) 47—50 Distinguishable states 124—128 593 654—657 Distributive law 23 868 Domain 6 10 Dominator 915—917 923—924 934 939 959 Domolki's algorithm 312—313 452 Don't care entry [in an LR(k) table] 581—582 643 see DPDA see "Deterministic pushdown automaton" DPDT see "Deterministic pushdown transducer" Dyck language 209 e see "Empty string" e-free first (EFF) 381—382 392 398 e-free grammar 147—149 280 302—303 397 e-move 168 190 e-production 92 147—149 362 674—680 686—688 690 Earley's algorithm 73 281 320—321 397—398 Earley, J. 332 578 645 EDGE 37 Eickel, J. 455 Eight queens problem 309 Elementary operation 317 319 326 395 Emptiness problem 130—132 144—145 483 Empty set 2 Empty string 15 Endmarker 94 271 341 404 469 484 698 701 707 716 Engeler, E. 58 English, structure of 55—56 78 Englund, D.E. 936 960 Entrance (of an interval) 947 Entry (of a block) 912 Equivalence class see "Equivalence relation" Equivalence of LR(k) table sets 585—588 590—596 601 617 625 652—683 Equivalence of parsers 560 562—563 580—581 see "Exact Equivalence of programs 909 936 Equivalence of straight-line blocks 848 891 Equivalence problem 130—132 201 237 362 684—686 709 936 Equivalence relation 6—7 12—13 126 133—134 Equivalence topological see "Equivalence of straight-line blocks" Equivalence under algebraic laws 868—869 Erase state 691 693 708 Error correction/recovery 59 72—74 77 367 394 399 426 546 586 615 644 781 937 Error indication 583 Essential blank (of a precedence matrix) 556 Euclid's Algorithm 26—27 36 910 Evans, A. 455 512 Evey, R.J. 166 192 Exact equivalence (of parsers) 555—559 562 585 Exit (of an interval) 947 Extended precedence grammar 410—415 424—425 429 451 717 Extended pushdown automaton 173—175 185—186 Extended pushdown transducer 269 Extended regular expression 253—258 extensible language 58 501—504 Feldman, J.A. 77 455 Fetch function (of a recognizer) 94 FIN 135 207 Final configuration 95 113 169 175 224 228 339 583 648 Final state 113 168 224 Finite ambiguity 332 Finite automaton 112—121 124—128 255—261 397 see Finite control 95 443 see Finite set 11 14 Finite transducer 223—227 235 237—240 242 250 252 254—255 258 722 first 300 335—336 357—359 Fischer, M.J. 102 426 719 843 Fischer, P.C. 36 Flipping (of statements) 853—859 861—863 Flow chart 79—82 see Flow graph 907 913—914 Floyd, R.W. 52 77 166 211 314 426 455 563 878 906 Floyd-Evans productions 443—448 452 564—579 FOLLOW 343 425 616 640 Formal Semantic Language 455 FORTRAN 252 501 912 958 Frailey, D.J. 906 Freeman, D.N. 77 263 Frequency profile 912 Frontier (of a parse tree) 140 Function 10 14 Futrelle, R.P. 237 Galler, B.A. 58 Gear, C.W. 936 gen 945—955 Generalized syntax-directed translation scheme 758—765 782—783 Generalized top-down parsing language 469—485 748—753 Gentleman, W.M. 61 Gill, A. 138 Ginsburg, S. 102—103 138 166 211 237 Ginzburg, A. 138 GNF see "Greibach normal form" Gotlieb, C.C. 314 goto 386—390 392 598 616
Ðåêëàìà
-inaccessible set of LR(k) tables 
|
|
Î ïðîåêòå