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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : -OnTimeBooks-, Phoenix, AZ, Etats-Unis
Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. N° de réf. du vendeur OTV.3540137203.G
Quantité disponible : 1 disponible(s)
Vendeur : medimops, Berlin, Allemagne
Etat : good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present. N° de réf. du vendeur M03540137203-G
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 17884084-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. Delivery takes 25-30 days. Excellent Customer Service. N° de réf. du vendeur POD-157035
Quantité disponible : 10 disponible(s)
Vendeur : medimops, Berlin, Allemagne
Etat : as new. Wie neu/Like new. N° de réf. du vendeur M03540137203-N
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 17884084
Quantité disponible : Plus de 20 disponibles
Vendeur : Roland Antiquariat UG haftungsbeschränkt, Weinheim, Allemagne
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. N° de réf. du vendeur 305240
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : 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. N° de réf. du vendeur 9783540137207
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 17884084-n
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 240. N° de réf. du vendeur 2658584182
Quantité disponible : 4 disponible(s)