| 
|
QuoteRef: solnN_1971
topics >
all references >
Topic:
string transformation languages
Topic:
structure transformation languages
Topic:
grammar modification
ThesaHelp:
references sa-sz
Topic:
language extension via macros
Group:
type declaration
Topic:
data type by lexical constraints
Topic:
constants
Topic:
primitive data types for Thesa
Topic:
function syntax by pattern
Topic:
semantic grammar
Reference
Solntseff, N., Yegerski, A., "A survey of extensible programming languages", Annual Review of Automatic Programming, 7, pp. 267-307, 1971. Google
275 ;;Quote: can extend a language by straight textual substitution; e.g., replace 'complex' with its realization QuoteRef: solnN_1971 ;;280 Leavenworth, R.M. '66: macro's which do pattern match with literals and classes then replace pattern based on matching string QuoteRef: solnN_1971 ;;281 Leavenworth RM '66: macros with alternate patterns can be tested in replacement pattern using label keyed alternatives QuoteRef: solnN_1971 ;;282 Standish '69: =+ | , i.e., class appended with classes and
284 ;;Quote: Proteus included the format of literals as part of a type definition
284 ;;Quote: declare operations as a pattern giving data types, operator, and result type QuoteRef: solnN_1971 ;;293 Iron '69 (Imp): patterns to manipulate the tree structure of a program e.g., can specify which pass a transformation can be made.
Topic: string transformation languages (17 items)
Topic: structure transformation languages (7 items)
Topic: grammar modification (10 items)
ThesaHelp: references sa-sz (237 items)
Topic: language extension via macros (23 items)
Group: type declaration (5 topics, 107 quotes)
Topic: data type by lexical constraints (15 items)
Topic: constants (21 items)
Topic: primitive data types for Thesa (82 items)
Topic: function syntax by pattern (15 items)
Topic: semantic grammar (23 items)