Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
6Activity
0 of .
Results for:
No results containing your search query
P. 1
Linear Data Structures for Storage Allocation in Attribute Evaluators

Linear Data Structures for Storage Allocation in Attribute Evaluators

Ratings: (0)|Views: 91 |Likes:
Published by Sluiman
Practical and theoretical results have been found concerning the use of global storage allocation for the instances of applied occurrences of an attribute.

The practical results focus on the necessary and sufficient conditions to decide at evaluator construction time whether an evaluator can allocate the instances of an applied occurrence to a number of global variables, stacks and queues. Checking these conditions takes polynomial time for a simple multi-visit evaluator and exponential time for an absolutely non-circular evaluator.

The theoretical results are concerned with the data structures that are required for the global storage allocation of the instances of applied occurrences of an attribute. For this purpose, the general class of basic linear data structures is introduced. This class of data structures can also be used to explore the theoretical possibilities and limitations of storage allocation techniques in domains other than attribute grammars.
Practical and theoretical results have been found concerning the use of global storage allocation for the instances of applied occurrences of an attribute.

The practical results focus on the necessary and sufficient conditions to decide at evaluator construction time whether an evaluator can allocate the instances of an applied occurrence to a number of global variables, stacks and queues. Checking these conditions takes polynomial time for a simple multi-visit evaluator and exponential time for an absolutely non-circular evaluator.

The theoretical results are concerned with the data structures that are required for the global storage allocation of the instances of applied occurrences of an attribute. For this purpose, the general class of basic linear data structures is introduced. This class of data structures can also be used to explore the theoretical possibilities and limitations of storage allocation techniques in domains other than attribute grammars.

More info:

Categories:Types, Research, Science
Published by: Sluiman on Jan 03, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

08/10/2010

pdf

text

original

 
Linear Data Structuresfor Storage Allocation inAttribute Evaluators
F. J. Sluiman
 
Linear Data Structures for Storage Allocation inAttribute Evaluators
 
ISBN 90-365-1713-3
Copyrightc
2000, 2001 by F. J. Sluiman, Amsterdam, Netherlands.All rights reserved. No part of this publication may be reproduced, stored in a retrieval system or transmitted in any formor by any means, electronic, mechanical, photocopying, recording or otherwise without written permission of the author,F. J. Sluiman, P.O. Box 6034, 9702 HA Groningen, Netherlands.The author was sponsored by the Netherlands Computer Science Research Foundation (SION) with financial support fromthe Netherlands Organisation for Scientific Research (NWO).

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->