pickabook books with huge discounts for everyone
pickabook books with huge discounts for everyone
Visit our new collection website www.collectionsforschool.co.uk
     
Email: Subscribe to news & offers:
Need assistance? Log In/Register


Item Details
Title: GENERATING LANGUAGE-BASED ENVIRONMENTS
By: Thomas W. Reps
Format: Paperback

List price: £18.99


We currently do not stock this item, please contact the publisher directly for further information.

ISBN 10: 0262681463
ISBN 13: 9780262681469
Publisher: MIT PRESS LTD
Pub. date: 27 August, 2004
Series: ACM Doctoral Dissertation Award
Pages: 152
Description: 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 language-specific knowledge in interactive programming environments.
Synopsis: 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 language-specific knowledge in interactive programming environments. It makes a basic contribution in this area by proposing an attribute-grammar framework for incremental semantic analysis and establishing its algorithmic foundations. The results are theoretically important while having immediate practical utility for implementing environment-generating systems.The book's principal technical results include: an optimal-time algorithm to incrementally maintain a consistent attributed-tree of attribute grammar subclasses, allowing an optimizing environment-generator 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 worst-case 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.
Publication: US
Imprint: MIT Press
Returns: Returnable
Some other items by this author:

TOP SELLERS IN THIS CATEGORY
Learn Adobe Animate CC for Interactive Media (Paperback)
Pearson Education (US)
Our Price : £11.10
more details
Level Up! The Guide to Great Video Game Design (Paperback)
John Wiley & Sons Inc
Our Price : £20.44
more details
NES/Famicom: A Visual Compendium (Hardback)
Bitmap Books
Our Price : £28.49
more details
Learning to Program in Python (Paperback)
PG Online Limited
Our Price : £13.30
more details
Java Concurrency in Practice (Paperback)
Pearson Education (US)
Our Price : £44.49
more details
BROWSE FOR BOOKS IN RELATED CATEGORIES
 COMPUTING AND INFORMATION TECHNOLOGY
 computer programming


Information provided by www.pickabook.co.uk
SHOPPING BASKET
  
Your basket is empty
  Total Items: 0
 

NEW
Ramadan and Eid al-Fitr A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
add to basket

Learning
That''s My Story!: Drama for Confidence, Communication and C... The ability to communicate is an essential life skill for all children, underpinning their confidence, personal and social wellbeing, and sense of self.
add to basket