Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Serviciul de curierat Cargus 28.00 lei Easybox 20.00 lei FAN Courier 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Parsing Theory, 1

Name: Parsing Theory, 1
Brand: Springer, Berlin
SKU: 05183074
Price: 265.12 RON
Availability: InStock
Author: Seppo Sippu
ISBN: 9783642648014

Volume I Languages and Parsing

Seppo Sippu

Eljas Soisalon-Soininen

Limba

engleză

Carte Carte broșată

Codul Libristo: 05183074

Editura Springer, Berlin, iulie 2013

The theory of parsing is an important application area of the theory of formal languages and automat... Descrierea completă

Codul Libristo: 05183074

122 b

265.12 lei

În depozitul extern Expediem în 5-8 zile

Până la 30 de zile pentru returnare

Clienții au cumpărat de asemenea

Storia Di Cento Anni 1750-1850 Cesare Cant?

Carte broșată

173.83 lei

RENOIR ENTRE DONES PAUL PERRIN Y LEYRE BOZAL

Copertă tare

246.70 lei

Biostatistik und Grundlagen der Beprobung Christian Germer

Carte broșată

75.46 lei

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.