Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Formal Languages and Compilation

by Stefano Crespi Reghizzi
Save 35% Save 35%
Current price ₹4,366.00
Original price ₹6,716.00
Original price ₹6,716.00
Original price ₹6,716.00
(-35%)
₹4,366.00
Current price ₹4,366.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9781447168683
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 399
  • Original Price: EUR 59.99
  • Language: English
  • Edition: Softcover Repri
  • Item Weight: 583 grams
  • BISAC Subject(s): Logic, Programming / General, and Computer Science

From the Back Cover

This fully revised and expanded new edition elucidates the elegance and simplicity of the fundamental theory underlying Formal Languages and Compilation.

Retaining the reader-friendly, minimalist style of the first edition, this uniquely versatile textbook describes the essential principles and methods used for defining the syntax of artificial languages, and for designing efficient parsing algorithms and syntax-directed translators with semantic attributes. A comprehensive selection of topics is presented within a rigorous, unified framework, illustrated by numerous practical examples.

Features and topics:

  • Presents a novel conceptual approach to parsing algorithms that applies to extended BNF grammars, together with a parallel parsing algorithm (NEW)
  • Supplies supplementary teaching tools, including course slides and exercises with solutions, at an associated website
  • Unifies the concepts and notations used in different approaches, enabling an extended coverage of methods with a reduced number of definitions
  • Systematically discusses ambiguous forms, allowing readers to avoid pitfalls when designing grammars
  • Describes all algorithms in pseudocode, so that detailed knowledge of a specific programming language is not necessary
  • Makes extensive usage of theoretical models of automata, transducers and formal grammars
  • Includes concise coverage of algorithms for processing regular expressions and finite automata
  • Introduces static program analysis based on flow equations

This clearly-written, classroom-tested textbook is an ideal guide to the fundamentals of this field for advanced undergraduate and graduate students in computer science and computer engineering. Some background in programming is required, and readers should also be familiar with basic set theory, algebra and logic.

Dr. Stefano Crespi Reghizzi and Dr. Angelo Morzenti are Full Professors of Computer Engineering in the Department of Electronics and Computer Science at the Politecnico di Milano. Dr. Luca Breveglieri is an Associate Professor at the same institution.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us