  snobol (string oriented and symbolic language) is a series of computer programming languages developed between 1962 and 1967 at at&t bell laboratories by david j. farber, ralph e. griswold and ivan p. polonsky, culminating in snobol4. it was one of a number of text-string-oriented languages developed during the 1950s and 1960s; others included comit and trac. snobol4 stands apart from most programming languages by having patterns as a first-class data type (i.e. a data type whose values can be manipulated in all ways permitted to any other data type in the programming language) and by providing operators for pattern concatenation and alternation. strings generated during execution can be treated as programs and executed. snobol4 was quite widely taught in larger us universities in the late 1960s and early 1970s and was widely used in the 1970s and 1980s as a text manipulation language in the humanities. in recent years its use has faded as newer languages such as awk and perl have made string manipulation by means of regular expressions fashionable. snobol4 patterns subsume bnf grammars, which are equivalent to context-free grammars and more powerful than regular expressions.gimpel, j. f. 1973. a theory of discrete patterns and their implementation in snobol4. commun. acm 16, 2 (feb. 1973), 91-100. doi=http://doi.acm.org/10.1145/361952.361960 the "regular expressions" in current versions of awk and perl are in fact extensions of regular expressions in the traditional sense, but regular expressions, unlike snobol4 patterns, cannot be recursive, which gives a distinct computational advantage to snobol4 patterns. however, since perl 5.10 (released in december 2007), perl regular expressions can be recursive.{{cite web|au
Pattern_matching_programming_languages Programming_languages_created_in_the_1960s SNOBOL_programming_language_family Software_written_in_assembly_language Text-oriented_programming_languages