Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers
Author:
Open Access
- 1 April 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 29 (4) , 23-30
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Guarded attribute grammarsSoftware: Practice and Experience, 1993
- “Memo” Functions and Machine LearningNature, 1968