Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Parsing Theory

Volume I Languages and Parsing
BuchGebunden
228 Seiten
Englisch
Springererschienen am01.07.19881988
The theory of parsing is an important application area of the theory of formal languages and automata. 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.mehr
Verfügbare Formate
BuchGebunden
EUR53,49
BuchKartoniert, Paperback
EUR53,49
BuchGebunden
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextThe theory of parsing is an important application area of the theory of formal languages and automata. 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.
Details
ISBN/GTIN978-3-540-13720-7
ProduktartBuch
EinbandartGebunden
Verlag
Erscheinungsjahr1988
Erscheinungsdatum01.07.1988
Auflage1988
ReiheMonographs in Theoretical Computer Science. An EATCS Series
Seiten228 Seiten
SpracheEnglisch
IllustrationenVIII, 228 p. 1 illus.
Artikel-Nr.16206717

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr