Àâòîðèçàöèÿ
Ïîèñê ïî óêàçàòåëÿì
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
Ïðåäìåòíûé óêàçàòåëü
Goto function 374 392 GOTO graph 599—600 Governing table 581 Graham, R.L. 907 Graham, R.M. 455 Graham, S.L. 426 709 Grammar see "Bounded-right-context grammar" "Colmerauer "Context-free "Context-sensitive "Indexed "LC(k) "LL(k) "LR(k) "Operator "Precedence "Right-linear "Web Grammar splitting 631—645 Graph directed 37—52 Graph grammar see "Web grammar" Graph undirected 51 Gray, J.N. 192 280 455 500 709 Greek letters 214 Greibach normal form 153—162 243 280 362 668 681—684 690 708 Greibach, S.A. 102—103 166 211 Gries, D. 76—77 Griffiths, T.V. 314 Griswold, R.E. 505 Gross, M. 211 GTDPL see "Generalized top-down parsing language" Haines, L.H. 103 Halmos, P.R. 3 25 HALTING see "Recursive set" "Algorithm" Halting problem 35 Halting pushdown automaton 282—285 Handle (of a right-sentential form) 179—180 377 379—380 403—404 486 Harary, F. 52 Harrison, M.A. 138 192 280 455 500 709 Hartmanis, J. 36 192 Hash table 63 793—811 Hashing function 794—795 797—798 see "Linear "Random "Uniform Hashing on locations 804—807 Haskell, R. 280 Haynes, H.R. 578 Hays, D.G. 332 Header (of an interval) 938—939 Hecht, M.S. 960 Height in a graph 43 Height of an LR(k) table 598 Hellermann, H. 906 Hext, J.B. 314 Hochsprung, R.R. 77 Homomorphism 17—18 197 207 209 213 689 Hopcroft, J.E. 36 102—103 138 192 211 368 399 690 843 960 Hopgood, F.R. A. 76 455 Horning, J.J. 76—77 450 465 Horwitz, L.P. 906 Huffman, D.A. 138 Ianov, I.I. 937 Ibarra, O. 192 Ichbiah, J.D. 426 579 Identifier 60—63 252 254 Igarishi, S. 878 IN 944—955 959 In-degree 39 Inaccessible state see "Accessible state" Inaccessible symbol (of a context-free grammar) 145—147 Inclusion (of sets) 3 208 Independent nodes (of a dag) 552—555 Index (of an equivalence relation) 7 Indexed grammar 100—101 Indirect chaining see "Chaining" Indirect lexical analysis 61—62 254—258 Indistinguishable states see "Distinguish-able states" Induction see "Proof by induction" Induction variable 925—929 Infinite set 11 14 Infix expression 214—215 Ingerman, P.Z. 77 Inherent ambiguity 205—207 209 Inherited attribute 777—781 784 INIT 135 207 Initial configuration 95 113 169 583 648 Initial state 113 168 224 Initial symbol (of a pushdown automaton) 168 Injection 10 Input head 94—96 Input symbol 113 168 218 224 Input tape 93—96 Input variable 845 Interior frontier 140 Intermediate (of an indexed grammar) 100 Intermediate code 59 65—70 722—727 844—845 908—909 Interpreter 55 721 725 Interrogation state 650 658 Intersection 4 197 201 208 484 689 Intersection list 824—833 839—840 Interval analysis 937—960 Inverse (of a relation) 6 10—11 Inverse finite transducer mapping 227 Irland, M.I. 36 Irons, E.T. 77 237 314 455 Irreducible flow graph 953—955 Irreflexive relation 9 Item (Earley's algorithm) 320 331 397—398 Item [LR(k)] 381 see Johnson, S.C. 665 Johnson, W.L. 263 k-predictive parsing algorithm see "Predictive parsing algorithm" k-uniform hashing function see "Uniform hashing function" Kameda, T. 138 Kaplan, D.M. 937 Karp, R.M. 906 Kasami, T. 332 Kennedy, K. 906 960 Keyword 59 259 KGOTO 636—637 Kleene closure see "Closure of Kleene, S.C. 36 124 Knuth, D.H. 36 58 368 399 485 690 709 787 811 912 960 Korenjak, A.J. 368 399 636 645 690 Kosaraju, S.R. 138 Kuno, S. 313 Kurki-Suonio, R. 368 690 La France, J.E. 578—579 Labeled graph 38 42 882 896—897 LaLonde, W.R. 450 LALR(k) grammar see "Lookahead LR(k) grammar" Lambda calculus 29 Language 16—17 83—84 86 96 114 169 816 see "Grammar" LBA see "Linear bounded automaton" LC(k) grammar/language 362—367 Leaf 39 Leavenworth, B.M. 58 501 Lee, E.S. 450 Lee, J.A. N. 76 Left cover 275—277 280 307 690 Left factoring 345 Left parse see "Leftmost derivation" "Top-down Left parse language 273 277 Left parser 266—268 Left recursion 484 see Left-bracketed representation (for trees) 46 Left-corner parse 278—280 310—312 362—367 Left-corner parser 310—312 Left-linear grammar 122 Left-parsable grammar 271—275 341 672—674 Left-recursive grammar 153—158 287—288 294—298 344—345 681—682 Left-sentential form 143 Leftmost derivation 142—143 204 318—320 Leinius, R.P. 399 426 645 Length of a derivation 86 Length of a string 16 Lentin, A. 211 Lewis, P.M. II 192 237 368 621 757 843 Lexical analysis 59—63 72—74 251—264 721—722 781 789 823 Lexicographic order 13 Limit flow graph 941 Linear bounded automaton 100 see Linear grammar/language 165—170 207—208 237 Linear hashing function 804—805 Linear order 10 13—14 43—45 865 Linear precedence functions 543—563 Linear set 209—210 Linearization graph 547—550 Link editor 721 LL(0) grammar 688—689 LL(1) grammar 342—349 483 662 LL(k) grammar/language 73 333—368 397—398 448 452 579 643 664 666—690 709 711 716—717 730—732 742—746 LL(k) table 349—351 354—355 Load module 721 Loader 721 Loeckx, J. 455 Logic 19—25 Logical connective 21—25 Lookahead 300 306 331 334—336 363 371 Lookahead LR(k) grammar 627—630 642—643 662 Loop unrolling 930—932 Looping (in a pushdown automaton) 186—189 Loops (in programs) 907—960 Lowry, E.S. 936 960 LR(0) grammar 590 642 646—657 690 699 701 708 LR(1) grammar 410 448—450 690 701 LR(k) grammar/language 73 369 371—399 402 424 428 430 448 579—665 666—674 730 732—736 740—742 LR(k) table 374—376 392—394 398 580—582 Lucas, P. 58 Luckham, D.C. 909 937 Lukasiewicz, J. 214 Major node 889—890 903 Manna, Z. 937 Mapping see "Function" Marill, M. 936 Marked closure 210 Marked concatenation 210 Marked union 210 Markov algorithm 29 Markov, A.A. 29 Martin, D.F. 563 Maurer, W.D. 811 MAX 135 207 209 Maxwell, W.L. 77 McCarthy, J. 77 McClure, R.M. 77 485 757 McCullough, W.S. 103 McKeeman, W.M. 76—77 426 455 936 Mcllroy, M.D. 58 61 757 843 McNaughton, R. 124 690 Medlock, C.W. 936 960 Membership (relation on sets) 1 Membership problem 130—132 Memory (of a recognizer) 93—96 Memory references 903—904 Mendelson, E. 25 META 485 Meyers, W.J. 906 Miller, G.A. 124 Miller, R.E. 906 Miller, W.F. 82 MIN 135 207 209 Minimal fixed point 108—110 121—123 160—161 Minor node 889 903 Minsky, M. 29 36 102 138 Mixed strategy precedence grammar 435 437—439 448 452 552 modus ponens 23 Montanari, U.G. 82 Moore, E.F. 103 138 Morgan, H.L. 77 263 Morris, D. 77 313 Morris, R. 811 843 Morse, S.P. 426 579 Moulton, P.G. 77 Move (of a recognizer) 95 Msp see "Mixed strategy precedence grammar" Muller, M.E. 77 Multiple address code 65 724—726 Munro, I. 52 Nakata, I. 906 NAME 769 Natural language 78 281 see Naur, P. 58 Neutral property 814—815 823 827 840—841 NEWLABEL 774 NeXT 598—599 609 616 Next move function 168 224 Nievergelt, J. 936 Node 37 Non-left-recursive grammar see "Left-recursive grammar" Nondeterministic algorithm 285 308—310 Nondeterministic finite automaton 117 see Nondeterministic FORTRAN 308—310 Nondeterministic property grammar 823 841 Nondeterministic recognizer 95 see Nonnullable symbol see "Nullable symbol" Nonterminal 85 100 218 458 Normal form deterministic pushdown automaton 690—695 Northcote, R.S. 578 Nullable symbol 674—680 Object code 59 720 Oettinger, A. 192 313 Ogden's lemma 192—196 Ogden, W. 211 One-turn pushdown automaton 207—208 One-way recognizer 94 Open block 856—858 Open portion (of a sentential form) 334 369 Operator grammar/language 165 438 Operator precedence grammar/language 439—443 448—450 452 550—551 711—718 Order (of a syntax-directed translation) 243—251 Ordered dag 42 see Ordered graph 41—42 Ordered tree 42—44 see Ore, O. 52 OUT 944—958 Out degree 39 Output symbol 218 224 Output variable 844 Pager, D. 621 Painter, J.A. 77 Pair, C. 426 PAL 512—517 Parallel processing 905 Parenthesis grammar 690 Parikh's theorem 209—211 Parikh, R.J. 211 Park, D.M. R. 909 937 Parse lists 321 Parse table 316 339 345—346 348 351—356 364—365 374 Parse tree 139—143 179—180 220—222 273 379 464—466 see Parsing 56 59 63—65 72—74 263—280 722 781 see "Shift-reduce "Top-down Parsing action function see "Action function" Parsing automaton 645—665 Parsing machine 477—482 484 747—748 750—753 Partial acceptance failure (of a TDPL or GTDPL program) 484 Partial correspondence problem 36 Partial function 10 Partial left parse 293—296 Partial order 9—10 13—15 43—45 865 Partial recursive function see "Recursive function" Partial right parse 306 Pass (of a compiler) 723—724 782 Paterson, M.S. 909 937 Path 39 51 Pattern recognition 79—82 Paul, M. 455 Paull, M C. 166 690 Pavlidis, T. 82 PDA see "Pushdown automaton" pdt see "Pushdown transducer" Perfect induction 20 Perles, M. 211
Ðåêëàìà
|
|
Î ïðîåêòå