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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
£ 13.44 shipping from U.S.A. to United Kingdom
Destination, rates & speedsFREE shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Condition: 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. Seller Inventory # ZB1320487
Quantity: 1 available
Seller: Buchpark, Trebbin, Germany
Condition: 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. Seller Inventory # 795545/202
Quantity: 1 available
Seller: Ammareal, Morangis, France
Hardcover. Condition: 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. Seller Inventory # E-843-027
Quantity: 1 available
Seller: Ammareal, Morangis, France
Hardcover. Condition: 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. Seller Inventory # E-577-952
Quantity: 1 available
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: 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. Seller Inventory # ABNR-89615
Quantity: 1 available
Seller: Basi6 International, Irving, TX, U.S.A.
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-265541
Quantity: 1 available
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
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. Seller Inventory # 305240
Quantity: 1 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: Used. pp. 240 67:B&W 6.69 x 9.61 in or 244 x 170 mm (Pinched Crown) Perfect Bound on White w/Gloss Lam. Seller Inventory # 51008425
Quantity: 1 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: Used. pp. 240. Seller Inventory # 2658584182
Quantity: 1 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: 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. Seller Inventory # 9783540137207
Quantity: 2 available