Awk — a pattern scanning and processing language

@article{Aho1979AwkA,
  title={Awk — a pattern scanning and processing language},
  author={Alfred V. Aho and Brian W. Kernighan and Peter J. Weinberger},
  journal={Software: Practice and Experience},
  year={1979},
  volume={9}
}
This paper describes the design and implementation of awk, a programming language which searches a set of files for patterns, and performs specified actions upon records or fields of records which match the patterns. Awk makes common data selection and transformation operations easy to express; for example, \documentclass{article}\pagestyle{empty}\begin{document}$$ {\rm length > 72} $$\end{document} is a complete awk program that prints all input lines whose length exceeds 72 characters. The… Expand
Pattern Matching in Strings
TLDR
Although regular expressions cannot describe all patterns that occur in information processing systems, the chapter illustrates that some modest generalizations of the string matching problem are NP-complete. Expand
String-Pattern Matching in a Visual Programming Language
TLDR
In the CALVIN language, designed for the creation of courseware, the authors have used purely visual constructs throughout, and the content of strings may be analysed by using a graphical and augmented version of regular expressions to specify patterns. Expand
Fast, flexible syntactic pattern matching and processing
TLDR
The results indicate that TAWK can be used to quickly and easily perform a variety of common software engineering tasks, and the extensions to accommodate non-syntactic features significantly extend the generality of syntactic matchers. Expand
Tools for Printing Indexes
TLDR
A set of programs for processing and printing the index for a book or a manual that uses a long pipeline of short awk programs rather than a single program in a conventional language to meet special requirements that arise in different indexing styles. Expand
Effective pattern matching of source code using abstract syntax patterns
TLDR
The results indicate that TAWK can be used to quickly and easily perform a variety of common software engineering tasks, and the extensions to accommodate non-syntactic features significantly extend the generality of syntactic matchers. Expand
A regular expression pattern matching processor for APL
TLDR
This paper discusses classical regular expressions and their extension into the domain of APL in terms of locator templates, which describe patterns to be searched for, and action templates,Which specify an action to be performed when a match is encountered. Expand
The Flat File Database Generator Ffg
A fiat file is the simplest possible database. It consists of a single. unformatted text file in which each line corresponds to a record. k-l occurrences of a separator character divide each recordExpand
Hancock: A language for analyzing transactional data streams
TLDR
The obstacles to computing signatures from massive streams are described and how Hancock, a domain-specific language created to express computationally efficient signature programs cleanly, is explained. Expand
Writing Reusable Feature Programs with the Feature Language Extensions
TLDR
A set of programming language extensions that will allow the programmer to develop interacting features as reusable program mo dules even though the features may change the execution flow of each other. Expand
A pattern matching system
TLDR
A pattern matching system which has been implemented as a set of library procedures that provides a concise and consistent method of pattern definition and facilities for defining context sensitive pattern matching, defining repetitive patterns and defining alternatives. Expand
...
1
2
3
4
5
...

References

A fast string searching algorithm
TLDR
The algorithm has the unusual property that, in most cases, not all of the first <italic>i</italic) characters of a character string, “<italic>.” in another string, are inspected. Expand