Parsing Theory: Volume I Languages and Parsing (Monographs in Theoretical Computer Science. An EATCS Series, 15),Used

Parsing Theory: Volume I Languages and Parsing (Monographs in Theoretical Computer Science. An EATCS Series, 15),Used

Out of Stock
SKU: DADAX3642648010
Brand: Springer
Condition: New
$81.14
Sold out
Free Standard Shipping Across USA
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 3–5 business days
  • Estimated Delivery: 6–10 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem highlevel 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 "syntaxdirected", 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. Contextfree grammars were soon found to be the most convenient formalism for describing the syntax of programming languages, and accordingly methods for parsing contextfree languages were devel oped. Practical considerations led to the definition of various kinds of restricted contextfree grammars that are parsable by means of efficient deterministic lineartime algorithms.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed