Shantanu's Blog

Database Consultant

November 18, 2023

 

awk Case Study - 10

Formats its input into lines that are at most 60 characters long

# fmt - format
# input: text
# output: text formatted into lines of <= 60 characters

awk '/./ { for (i = 1; i <= NF; i++) addword($i) }
/^$/ { printline(); print "" }
END { printline() }

function addword(w) {
    if (length(line) + length(w) > 60)
        printline()
        line = line " " w
    }
function printline() {
    if (length(line) > 0) {
        print substr(line, 2)
        line = ""
    }
}' long.txt  

November 17, 2023

 

awk Case Study - 9

Cliche generator, which creates new cliches out of old ones. The input is a set of sentences like

# cat cliche.txt
A rolling stone:gathers no moss.
History:repeats itself.
He who lives by the sword:shall die by the sword.
A jack of all trades:is master of none.
Nature:abhors a vacuum.
Every man:has a price.
All's well that:ends well.

where a colon separates subject from predicate. Our cliche program combines a random subject with a random predicate; with luck it produces the occasional mildly amusing aphorism:

A rolling stone repeats itself.
History abhors a vacuum.
Nature repeats itself.
All's well that gathers no moss.
He who lives by the sword has a price.

# cliche - generate an endless stream of cliches
# input: lines of form subject:predicate
# output: lines of random subject and random predicate


awk 'BEGIN { FS = ":" }
{ x[NR] = $1; y[NR] = $2 }
END { for (;;) print x[randint(NR)], y[randint(NR)] }
function randint(n) {
    return int(n *rand()) + 1 
}' cliche.txt

Don't forget that this program is intentionally an infinite loop. 

Labels:


 

awk Case Study - 8

Isolate the words and aggregate the count for each word in an associative array. A word is a field without the punctuation marks like ? or ,

# wordfreq - print number of occurrences of each word 
# input: text 
# output: number-word pairs sorted by number 

awk '{
    gsub (/I [ ., : ; I ? ( ) { } ] /,  "" )
    for (i = 1; i <= NF; i++)
        count[$i]++
    }
END {
    for (w in count)
        print count[w], w | "sort -rn"
    }' capitals

Labels:


 

awk Case Study - 7

Print the names of the countries in Asia along with their populations and capitals:

# cat capitals
USSR Moscow
Canada Ottawa
China Beijing
USA Washington
Brazil Brasilia
India New Delhi
Mexico Mexico
France Paris
Japan Tokyo
Germany Bonn
England London

# cat countries
USSR 8649 275 Asia
Canada 3852 25 North America
China 3705 1032 Asia
USA 3615 237 North America
Brazil 3286 134 South America
India 1267 746 Asia
Mexico 762 78 North America
France 211 55 Europe
Japan 144 120 Asia
Germany 96 61 Europe
England 94 56 Europe

(make sure that the files are tab separated)

# awk 'BEGIN { FS = "\t"}
FILENAME == "capitals" {
    cap[$1] = $2
}
FILENAME == "countries" && $4 == "Asia" {
    print $1, $3, cap[$1]
}' capitals countries


USSR 275 Moscow
China 1032 Beijing
India 746 New Delhi
Japan 120 Tokyo

It would certainly be easier if we could just say something like

continent ~ /Asia/ { print $country, $population, $capital}

and have a program figure out where the fields are and how to put them together. This is how we would phrase this query in qawk

Labels:


 

awk Case Study - 6

The following program arith presents a sequence of addition problems like

7 + 9 = ?

After each problem, the user types an answer. If the answer is right, the user is praised and presented with another problem. If the answer is wrong, the program asks for the answer again. If the user provides no answer at all, the right answer is printed before the next problem is presented. The program is invoked with one of two command lines:

awk -f arith
awk -f arith n

If there is an argument after ari th on the command line, the argument is used to limit the maximum size of the numbers in each problem. After this argument has been read, ARGV [ 1 ] is reset to "-" so the program will be able to read the answers from the standard input. If no argument is specified, the maximum size will be 10.

BEGIN {
    maxnum = ARGC > 1 ? ARGV[1] : 10
    ARGV[1] = "-"
    srand()
    do {
        n1 = randint(maxnum)
        n2 = randint(maxnum)
        printf("%g + %g = ? ", n1, n2)
        while ((input = getline) > 0)
            if ($0 == n1 + n2) {
                print "Right!"
                break
            } else if ($0 == "") {
                print n1 + n2
                break
            } else
                printf("wrong, try again: ")
    } while (input > 0)
}
function randint(n) {
return int(rand()*n)+1
 }

Labels:


Archives

June 2001   July 2001   January 2003   May 2003   September 2003   October 2003   December 2003   January 2004   February 2004   March 2004   April 2004   May 2004   June 2004   July 2004   August 2004   September 2004   October 2004   November 2004   December 2004   January 2005   February 2005   March 2005   April 2005   May 2005   June 2005   July 2005   August 2005   September 2005   October 2005   November 2005   December 2005   January 2006   February 2006   March 2006   April 2006   May 2006   June 2006   July 2006   August 2006   September 2006   October 2006   November 2006   December 2006   January 2007   February 2007   March 2007   April 2007   June 2007   July 2007   August 2007   September 2007   October 2007   November 2007   December 2007   January 2008   February 2008   March 2008   April 2008   July 2008   August 2008   September 2008   October 2008   November 2008   December 2008   January 2009   February 2009   March 2009   April 2009   May 2009   June 2009   July 2009   August 2009   September 2009   October 2009   November 2009   December 2009   January 2010   February 2010   March 2010   April 2010   May 2010   June 2010   July 2010   August 2010   September 2010   October 2010   November 2010   December 2010   January 2011   February 2011   March 2011   April 2011   May 2011   June 2011   July 2011   August 2011   September 2011   October 2011   November 2011   December 2011   January 2012   February 2012   March 2012   April 2012   May 2012   June 2012   July 2012   August 2012   October 2012   November 2012   December 2012   January 2013   February 2013   March 2013   April 2013   May 2013   June 2013   July 2013   September 2013   October 2013   January 2014   March 2014   April 2014   May 2014   July 2014   August 2014   September 2014   October 2014   November 2014   December 2014   January 2015   February 2015   March 2015   April 2015   May 2015   June 2015   July 2015   August 2015   September 2015   January 2016   February 2016   March 2016   April 2016   May 2016   June 2016   July 2016   August 2016   September 2016   October 2016   November 2016   December 2016   January 2017   February 2017   April 2017   May 2017   June 2017   July 2017   August 2017   September 2017   October 2017   November 2017   December 2017   February 2018   March 2018   April 2018   May 2018   June 2018   July 2018   August 2018   September 2018   October 2018   November 2018   December 2018   January 2019   February 2019   March 2019   April 2019   May 2019   July 2019   August 2019   September 2019   October 2019   November 2019   December 2019   January 2020   February 2020   March 2020   April 2020   May 2020   July 2020   August 2020   September 2020   October 2020   December 2020   January 2021   April 2021   May 2021   July 2021   September 2021   March 2022   October 2022   November 2022   March 2023   April 2023   July 2023   September 2023   October 2023   November 2023  

This page is powered by Blogger. Isn't yours?