Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, Wen_US
dc.date.accessioned2014-12-08T15:27:25Z-
dc.date.available2014-12-08T15:27:25Z-
dc.date.issued1997en_US
dc.identifier.isbn0-8186-8271-Xen_US
dc.identifier.urihttp://hdl.handle.net/11536/19680-
dc.description.abstractAttribute grammars are a formalism for specifying computations on context-free languages. Due to the non-strictness of the if constructs in attribution equations, it is possible to avoid evaluating certain attribute instances in a syntax free. A dynamic evaluator can easily avoid such useless computations with a demand-driven approach. However, dynamic evaluators are not efficient because they need to keep the attribute dependence graph during evaluation, and they need to decide an evaluation order for each syntax tree. In contrast, a visit-oriented (static) evaluator can carefully re-arrange the evaluation order and still avoid unnecessary computations. We propose such a technique in this paper.en_US
dc.language.isoen_USen_US
dc.titleConditional evaluation in simple multi-visit attribute-grammar evaluatorsen_US
dc.typeProceedings Paperen_US
dc.identifier.journalASIA PACIFIC SOFTWARE ENGINEERING CONFERENCE AND INTERNATIONAL COMPUTER SCIENCE CONFERENCE, PROCEEDINGSen_US
dc.citation.spage455en_US
dc.citation.epage464en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000071091400047-
Appears in Collections:Conferences Paper