In this paper, we proposed a memory management strategy for dictionary object when the postscript interpreter operates by executing a sequence of objects. In particular, executing a name object causes the name to be looked up in some dictionary object...
In this paper, we proposed a memory management strategy for dictionary object when the postscript interpreter operates by executing a sequence of objects. In particular, executing a name object causes the name to be looked up in some dictionary object and the associated value to be fetched and maybe executed. Dictionary can be implemented using a sorted or unsorted linked list. We demonstrate that retrieval technique for the dictionary element is capable of hashing algorithm uses a fixed space for the storage and limits the size of a set and improvable hashing function.