The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed", that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
1. Elements of Language Theory.- 1.1 Mathematical Preliminaries.- 1.2 Languages.- 1.3 Random Access Machines.- 1.4 Decision Problems.- 1.5 Computational Complexity.- 1.6 Rewriting Systems.- Exercises.- Bibliographic Notes.- 2. Algorithms on Graphs.- 2.1 Basic Algorithms.- 2.2 Finding Strongly Connected Components.- 2.3 Computing Functions Defined on Graphs.- 2.4 Computing Relational Expressions.- Exercises.- Bibliographic Notes.- 3. Regular Languages.- 3.1 Regular Expressions.- 3.2 Finite Automata.- 3.3 Regular Grammars.- 3.4 Deterministic Finite Automata.- 3.5 Decision Problems on Regular Languages.- 3.6 Applications to Lexical Analysis.- Exercises.- Bibliographic Notes.- 4. Context-free Languages.- 4.1 Context-free Grammars.- 4.2 Leftmost and Rightmost Derivations.- 4.3 Ambiguity of Grammars.- 4.4 Useless and Nullable Symbols.- 4.5 Canonical Two-form Grammars.- 4.6 Derivational Complexity.- 4.7 Context-free Language Recognition.- Exercises.- Bibliographic Notes.- 5. Parsing.- 5.1 Pushdown Automata.- 5.2 Left Parsers and Right Parsers.- 5.3 Strong LL(k) Parsing.- 5.4 Strong LL(k) Grammars.- 5.5 Construction of Strong LL(1) Parsers.- 5.6 Implementation of Strong LL(1) Parsers.- 5.7 Simple Precedence Parsing.- Exercises.- Bibliographic Notes.- Bibliography to Volume I.- Index to Volume I.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 6,90 per la spedizione da Germania a Italia
Destinazione, tempi e costiGRATIS per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: Buchpark, Trebbin, Germania
Condizione: Sehr gut. Zustand: Sehr gut - Gepflegter, sauberer Zustand. Innen: Seiten vergilbt. Aus der Auflösung einer renommierten Bibliothek. Kann Stempel beinhalten. | Seiten: 240 | Sprache: Englisch | Produktart: Bücher. Codice articolo 795545/202
Quantità: 1 disponibili
Da: Ammareal, Morangis, Francia
Hardcover. Condizione: Très bon. Ancien livre de bibliothèque. Edition 1988. Tome 1. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1988. Volume 1. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-843-027
Quantità: 1 disponibili
Da: Ammareal, Morangis, Francia
Hardcover. Condizione: Très bon. Ancien livre de bibliothèque. Edition 1988. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations. Codice articolo E-577-952
Quantità: 1 disponibili
Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condizione: Fine. First edition, first printing, 228 pp., Hardcover, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Codice articolo ZB1320487
Quantità: 1 disponibili
Da: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germania
Hardcover. 228 p. Good condition. The reading pages are clean and unmarked. Slight signs of storage and use. Retired library copy with corresponding labelling. Otherwise a good copy. 9783540137207 Sprache: Englisch Gewicht in Gramm: 1000. Codice articolo 305240
Quantità: 1 disponibili
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Codice articolo ABNR-89615
Quantità: 1 disponibili
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-265541
Quantità: 1 disponibili
Da: Books Puddle, New York, NY, U.S.A.
Condizione: Used. pp. 240. Codice articolo 2658584182
Quantità: 1 disponibili
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be 'syntax-directed', that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is 'parsed' according to the syntax of the language, and the object code for the program is generated according to the semantics attached to the parsed syntactic entities. Context-free grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing context-free languages were devel oped. Practical considerations led to the definition of various kinds of restricted context-free grammars that are parsable by means of efficient deterministic linear-time algorithms. 240 pp. Englisch. Codice articolo 9783540137207
Quantità: 2 disponibili
Da: Biblios, Frankfurt am main, HESSE, Germania
Condizione: Used. pp. 240. Codice articolo 1858584188
Quantità: 1 disponibili