Parsing Theory
Produktnummer:
18350c0aefc5cb411682fea5ec37d5e1eb
| Autor: | Sippu, Seppo Soisalon-Soininen, Eljas |
|---|---|
| Themengebiete: | Algorithms Analysis Automat algorithm algorithm analysis and problem complexity automata complexity computer regular expressions |
| Veröffentlichungsdatum: | 01.07.1988 |
| EAN: | 9783540137207 |
| Sprache: | Englisch |
| Seitenzahl: | 228 |
| Produktart: | Gebunden |
| Verlag: | Springer Berlin |
| Untertitel: | Volume I Languages and Parsing |
Produktinformationen "Parsing Theory"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen