1973
DOI: 10.1145/361952.361960
|View full text |Cite
|
Sign up to set email alerts
|

A theory of discrete patterns and their implementation in SNOBOL4

Abstract: The notion of a discrete pattern is formalized and certain properties deduced. A pattern is shown to be a generalization of a formal language. Algorithms for implementing the kinds of patterns in SNOBOL4 are given. The general approach is to create, in-so-far as possible, a bottom-up parse from a top-down specification.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

1975
1975
1985
1985

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(10 citation statements)
references
References 3 publications
0
10
0
Order By: Relevance
“…We also needed numeric computation and the ability to control and access large data structures on files. Clearly Cobol or PL1 could have coped with the problem and Snobol [24] was nearly ideal in the facilities it offered, particularly for the contextual analysis of strings [25]. However, these were largemachine languages and it was an open question as to whether comparable facilities could be offered in an interactive language on a minicomputer.…”
Section: Overall Objectivesmentioning
confidence: 99%
“…We also needed numeric computation and the ability to control and access large data structures on files. Clearly Cobol or PL1 could have coped with the problem and Snobol [24] was nearly ideal in the facilities it offered, particularly for the contextual analysis of strings [25]. However, these were largemachine languages and it was an open question as to whether comparable facilities could be offered in an interactive language on a minicomputer.…”
Section: Overall Objectivesmentioning
confidence: 99%
“…(1) a language on A is any subset L^*; (2) if D_ is a set of languages on A, and B a possibly infinité set of symbols, a naming for L is any function u : B -> D_; (3) if KeJS andu(X) = LeL, then K is a rcame of L; 16 R. PINZANI, R. SPRUGNOLI (4) in gênerai, we shall not distinguish between a language and any one of its names; (5) if aeA, "a" will be considered conventionally as a name of the language { a } ; (6) E={e};…”
Section: Languagesmentioning
confidence: 99%
“…A language L has an internai séparation criterion (ISC) iff the following condition holds: let v = L n v" be any pattern and let w be any word matching v according to the canonical u-decomposition w = w 1 w 2 w 3 (w 1 eL,w 2 matching v"); then if w' = w 1 w" is any word matching the pattern v' = L k v, the canonical u'-decomposition of w' is w' = w 1 w 2 w' 3 . A séparation criterion which is not internai will be called external.…”
Section: Définitionmentioning
confidence: 99%
See 1 more Smart Citation
“…If no alternative succeeds, backtracking to an earlier state is attempted to seek alternatives to a formerly successful match. For descriptions of the matching process, see [10,11,13,15,21].…”
Section: Patterns In Snobol4mentioning
confidence: 99%