000			03346nam a2200541 i 4500
001			6267325
003			IEEE
005			20190220121646.0
006			m o d
007			cr |n|||||||||
008			151223s2004 maua ob 001 eng d
010			_z 83025639 (print)
020			_a0262181150
020			_a9780262256858 _qelectronic
020			_z9780262681469 _qprint
035			_a(CaBNVSL)mat06267325
035			_a(IDAMS)0b000064818b42f7
040			_aCaBNVSL _beng _erda _cCaBNVSL _dCaBNVSL
050		4	_aQA76.6 _b.R44 1984eb
082	0	0	_a001.64/2 _219
100	1		_aReps, Thomas W., _q(Thomas William) _eauthor.
245	1	0	_aGenerating language-based environments / _cThomas W. Reps.
264		1	_aCambridge, Massachusetts : _bMIT Press, _cc1984.
264		2	_a[Piscataqay, New Jersey] : _bIEEE Xplore, _c[2004]
300			_a1 PDF (138 pages) : _billustrations.
336			_atext _2rdacontent
337			_aelectronic _2isbdmedia
338			_aonline resource _2rdacarrier
490	1		_aAcm doctoral dissertation award
500			_aIncludes indexes.
502			_aOriginally presented as the author's thesis (Ph. D.)--Cornell University, 1983.
504			_aIncludes bibliographical references (p. )[129]-134.
506	1		_aRestricted to subscribers or individual electronic text purchasers.
520			_aThis 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.
530			_aAlso available in print.
538			_aMode of access: World Wide Web
588			_aDescription based on PDF viewed 12/23/2015.
650		0	_aComputer programming.
650		0	_aInteractive computer systems.
650		0	_aText editors (Computer programs)
650		0	_aProgramming languages (Electronic computers) _xSemantics.
655		0	_aElectronic books.
710	2		_aIEEE Xplore (Online Service), _edistributor.
710	2		_aMIT Press, _epublisher.
776	0	8	_iPrint version _z9780262681469
830		0	_aAcm doctoral dissertation award
856	4	2	_3Abstract with links to resource _uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=6267325
999			_c39239 _d39239