Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5912Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Teitelman, Warren | - |
| dc.date | 2004-10-04T14:09:05Z | - |
| dc.date | 2004-10-04T14:09:05Z | - |
| dc.date | 1967-07-01 | - |
| dc.date.accessioned | 2013-10-09T02:41:57Z | - |
| dc.date.available | 2013-10-09T02:41:57Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-087 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5912 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | This memo describes a notion of programming language for expressing, from within a LISP system, string manipulation such as those performed in COMIT. The COMIT formalism has been extended in several ways: the patterns (the left-half constituents of COMIT terminology) can be variable names of the results of computation; predicates can be associated with these elementary patterns allowing more precise specifications of the segments they match; the names of elementary patterns themselves may be variable or the results if computation; it is no longer necessary to restrict the operations to a linear string of characters (or words) since elementary patterns can themselves match structures; etc. Similar generalizations exist for formats, i.e. what corresponds to the right-half of the COMIT rule. | - |
| dc.format | 61 p. | - |
| dc.format | 27931862 bytes | - |
| dc.format | 2829253 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-087 | - |
| dc.title | FLIP - A Format List Processor | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
