Generating language-based environments / (Record no. 72980)

000 -LEADER
fixed length control field 03427nam a2200553 i 4500
001 - CONTROL NUMBER
control field 6267325
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220712204630.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 151223s2004 maua ob 001 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
-- print
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 0262181150
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9780262256858
-- electronic
082 00 - CLASSIFICATION NUMBER
Call Number 001.64/2
100 1# - AUTHOR NAME
Author Reps, Thomas W.,
245 10 - TITLE STATEMENT
Title Generating language-based environments /
300 ## - PHYSICAL DESCRIPTION
Number of Pages 1 PDF (138 pages) :
490 1# - SERIES STATEMENT
Series statement Acm doctoral dissertation award
500 ## - GENERAL NOTE
Remark 1 Includes indexes.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
General subdivision Semantics.
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267325
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cambridge, Massachusetts :
-- MIT Press,
-- c1984.
264 #2 -
-- [Piscataqay, New Jersey] :
-- IEEE Xplore,
-- [2004]
336 ## -
-- text
-- rdacontent
337 ## -
-- electronic
-- isbdmedia
338 ## -
-- online resource
-- rdacarrier
588 ## -
-- Description based on PDF viewed 12/23/2015.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer programming.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Interactive computer systems.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Text editors (Computer programs)
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming languages (Electronic computers)

No items available.