Title
Generating LanguageBased Environments (Acm Doctoral Dissertation Award),Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
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
Payment Option
This book addresses a fundamental software engineering issue, applying formal techniques and rigorous analysis to a practical problem of great current interest: the incorporation of languagespecific knowledge in interactive programming environments. It makes a basic contribution in this area by proposing an attributegrammar framework for incremental semantic analysis and establishing its algorithmic foundations. The results are theoretically important while having immediate practical utility for implementing environmentgenerating systems. The book's principal technical results include: an optimaltime algorithm to incrementally maintain a consistent attributedtree of attribute grammar subclasses, allowing an optimizing environmentgenerator to select the most efficient applicable algorithm; a general method for sharing storage among attributes whose values are complex data structures; and two algorithms that carry out attribute evaluation while reducing the number of intermediate attribute values retained. While others have worked on this last problem, Reps's algorithms are the first to achieve sublinear worstcase behavior. One algorithm is optimal, achieving the log n lower space bound in nonlinear time, while the second algorithm uses as much as root n. space but runs in linear time.
⚠️ 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.