Haripriyan, HK and Srikant, YN and Shankar, Priti (1988) A compiler writing system based on affix grammars. In: Computer Languages, 13 (1). pp. 1-11.Full text not available from this repository.
We present an algorithm for testing the suitability of an affix grammar for deterministic, one-pass, bottom-up parsing which is an improvement over the one suggested by Pohlmann . The space requirements of the new algorithm are considerably less than that of Pohlmann's. We also describe an implementation of Pohlmann's algorithm and methods for improving its space requirements.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Elsevier science.|
|Keywords:||Compilers;Affix grammars;Automatic compiler generation; Translation;Parsing.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||31 Aug 2010 07:10|
|Last Modified:||31 Aug 2010 07:10|
Actions (login required)