| 
|
QuoteRef: hallJC5_1974
topics >
all references >
Topic:
boolean values, binary numbers, and bit strings
Topic:
spaces in text
Topic:
procedure valued variables
Topic:
logic programming
Topic:
pattern brackets
Topic:
access by current position
Topic:
evaluate operator
Topic:
if-then-else test chain
ThesaHelp:
references g-h
Topic:
pronoun reference
Topic:
accessing a sequence
Topic:
Thesa data structures
Topic:
data record
Topic:
using pointers in Thesa
Group:
data structures
Topic:
pointers to data
Topic:
recursive data structures
Topic:
pattern matching
Topic:
structure transformation languages
Group:
program control
Topic:
backtracking
Topic:
uniform language systems
Topic:
localized understanding
Reference
Hallyburton, J.C., Jr., "Advanced data structure manipulation facilities for the SNOBOL 4 programming language", Ph.D. thesis, University of Arizona, Department of Computer Science, May 1974. Google
8 ;;Quote: a data structure is all fields reachable from some aggregate QuoteRef: hallJC5_1974 ;;37 a(3) = "xyz" in SNOBOL is setting an array element while a (3) ="xyz" means "in A look for the third element and replace it by the string "xyz"
38 ;;Quote: like pattern matching in a string, traverse data structures with directives QuoteRef: hallJC5_1974 ;;40 directive needle points into directive while cursor points into data structure. the pair can be pushed on stack with needle pointing to next element in directive QuoteRef: hallJC5_1974 ;;41 sequention (apply A then B) by .larrow. .eq. d=a .larrow. b, succeeds if both directives succeed.
41 ;;Quote: SNOBOL backtracks if an alternation fails QuoteRef: hallJC5_1974 ;;41 forward alternation: a!b succeeds if either a or b succeeds but no backtrack. QuoteRef: hallJC5_1974 ;;43 null string acts as success (sxx for side effects) QuoteRef: hallJC5_1974 ;;44 list has index directive e.g., A(3) points to the 3rd aggregate of A QuoteRef: hallJC5_1974 ;;47 can use value of expression as directive (indirection) by * QuoteRef: hallJC5_1974 ;;48 index into current object (CO) by /field name QuoteRef: hallJC5_1974 ;;48 self-processing data structures eg */'proc' accesses procedure field QuoteRef: hallJC5_1974 ;;58 d=a&b means apply a then b at the same cursor place- always succeeds
122 ;;Quote: define global directives with the same effect on many types of aggregates
122 ;;Quote: usually design data structures for localized processing, e.g., with an implicit cursor position
Topic: boolean values, binary numbers, and bit strings (44 items)
Topic: spaces in text (6 items)
Topic: procedure valued variables (34 items)
Topic: logic programming (34 items)
Topic: pattern brackets (15 items)
Topic: access by current position (7 items)
Topic: evaluate operator (7 items)
Topic: if-then-else test chain (18 items)
ThesaHelp: references g-h (299 items)
Topic: pronoun reference (23 items)
Topic: accessing a sequence (9 items)
Topic: Thesa data structures (59 items)
Topic: data record (57 items)
Topic: using pointers in Thesa (49 items)
Group: data structures (12 topics, 275 quotes)
Topic: pointers to data (55 items)
Topic: recursive data structures (18 items)
Topic: pattern matching (42 items)
Topic: structure transformation languages (7 items)
Group: program control (27 topics, 547 quotes)
Topic: backtracking (30 items)
Topic: uniform language systems (25 items)
Topic: localized understanding (43 items)