Well, a (formal) language is defined as a set of words. Using that definition all valid regular expressions (as given to grep) are a language, all valid AWK programs are a language, etc.

AWK is a simple programming language. Contrary to grep (but like sed, what is surprising), it is Turing-complete: it can compute anything that can theoretically be computed. But it is specialized in text-processing: it processes an input record by record (line by line, by default), automatically splits the record into fields, etc. Also, it shares with grep and sed the heavy use of regular expressions (the variables RS and FS I wrote about are regular expressions, conditions can be regular expressions, etc.).

Reply via email to