Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers
Richard Frost · ACM SIGPLAN Notices · 1994
article Free Access Share on Using memorization to achieve polynomial complexity of purely functional executable specifications of non-deterministic top-down parsers Author: R. A. Frost School of Computer Science, University of Windsor, Windsor, Ontario, Canada N9B 3P4 School of Computer Science, University of Windsor, Windsor, Ontario, Canada N9B 3P4View Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 29Issue 4April 1994 pp 23–30https://doi.org/10.1145/181761.181764Published:01 April 1994Publication History 4citation165DownloadsMetricsTotal Citations4Total Downloads165Last 12 Months8Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF