001412294 000__ 03119cam\a2200493Ka\4500
001412294 001__ 1412294
001412294 003__ MaCbMITP
001412294 005__ 20240325105213.0
001412294 006__ m\\\\\o\\d\\\\\\\\
001412294 007__ cr\cn\nnnunnun
001412294 008__ 130208t20121984mau\\\\\ob\\\\001\0\eng\d
001412294 020__ $$a0262256851$$q(electronic bk.)
001412294 020__ $$a9780262256858$$q(electronic bk.)
001412294 020__ $$z9780262681469
001412294 020__ $$z0262681463
001412294 035__ $$a(OCoLC)827009783
001412294 035__ $$a(OCoLC-P)827009783
001412294 040__ $$aOCoLC-P$$beng$$epn$$cOCoLC-P
001412294 050_4 $$aQA76.6
001412294 08204 $$a001.64/2$$222
001412294 1001_ $$aReps, Thomas W.$$q(Thomas William)
001412294 24510 $$aGenerating language-based environments /$$cThomas W. Reps.
001412294 260__ $$aCambridge, Mass. ;$$aLondon :$$bMIT Press,$$c[2012?],$$c©1984.
001412294 300__ $$a1 online resource (138 pages)
001412294 336__ $$atext$$btxt$$2rdacontent
001412294 337__ $$acomputer$$bc$$2rdamedia
001412294 338__ $$aonline resource$$bcr$$2rdacarrier
001412294 500__ $$a"An MIT Press classic."
001412294 500__ $$aFacsim. of ed. originally published: ©1984.
001412294 506__ $$aAccess limited to authorized users.
001412294 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.
001412294 588__ $$aOCLC-licensed vendor bibliographic record.
001412294 650_0 $$aComputer programming.
001412294 650_0 $$aInteractive computer systems.
001412294 650_0 $$aText editors (Computer programs)
001412294 650_0 $$aProgramming languages (Electronic computers)$$xSemantics.
001412294 653__ $$aCOMPUTER SCIENCE/Programming Languages
001412294 655_0 $$aElectronic books
001412294 852__ $$bebk
001412294 85640 $$3MIT Press$$uhttps://univsouthin.idm.oclc.org/login?url=https://doi.org/10.7551/mitpress/3220.001.0001?locatt=mode:legacy$$zOnline Access through The MIT Press Direct
001412294 85642 $$3OCLC metadata license agreement$$uhttp://www.oclc.org/content/dam/oclc/forms/terms/vbrl-201703.pdf
001412294 909CO $$ooai:library.usi.edu:1412294$$pGLOBAL_SET
001412294 980__ $$aBIB
001412294 980__ $$aEBOOK
001412294 982__ $$aEbook
001412294 983__ $$aOnline