Grep Reference

Sun has an old and pretty weak implementation of grep that does not support -P  (Perl-style regular expressions) option but it does has a good man page :-). I recommend using GNU version of grep  (supplied by Sun or downloadable from SunFreeware.com ) instead, whenever possible. this is not much hassle to install it with Solaris.

Solaris 10 grep(1) manpage  � search a file for a pattern

Packages

Solaris 9 for SPARC Freeware List

• grep-2.5-sol9-sparc-local.gz The GNU version of grep which finds lines that match patterns - installs in /usr/local. Dependencies: pcre.
• grep-2.5.tar.gz Source Code. [Details]

Debian grep package

Filewatcher FTP Search -- nice tool for finding packages

Sun Grep

Solaris 9 Reference Manual Collection 

Limited regex (limited regular expressions like those described on the regexp(5) ):
 

grep /usr/bin/grep [-bchilnsvw] limited-regular-expression [filename...]
 

Fast string search
 

fgrep -- /usr/xpg4/bin/grep  -F [-c| -l| -q] [-bhinsvwx] -e string_list... [-f string_file]... [file...]
 

Extended regex (obsolite):

egrep -- /usr/xpg4/bin/grep -E [-c| -l| -q] [-bhinsvwx] [-e pattern_list...] -f pattern_file... [file...]

Be careful using the characters $, *, [, ^, |, (, ), and \  in the pattern_list because they are also meaningful to the shell. It is safest to enclose the entire pattern_list in single quotes �... �.

If no files are specified, grep assumes standard input. Normally, each line found is copied to standard output. The file name is printed before each line found if there is more than one input file.

Options

The following options are supported for both /usr/bin/grep and /usr/xpg4/bin/grep:

-b

Precede each line by the block number on which it was found. This can be useful in locating block numbers by context (first block is 0).

-c

Print only a count of the lines that contain the pattern.

-h

Prevents the name of the file containing the matching line from being appended to that line. Used when searching multiple files.

-i

Ignore upper/lower case distinction during comparisons.

-l

Print only the names of files with matching lines, separated by NEWLINE characters. Does not repeat the names of files when the pattern is found more than once.

-n

Precede each line by its line number in the file (first line is 1).

-s

Suppress error messages about nonexistent or unreadable files.

-v

Print all lines except those that contain the pattern.

-w

Search for the expression as a word as if surrounded by \<  and \>.

/usr/xpg4/bin/grep

The following options are supported for /usr/xpg4/bin/grep  only:

-e pattern_list  The -epattern_list option has the same effect as the pattern_list operand, but is useful when pattern_list begins with the hyphen delimiter. It is also useful when it is more convenient to provide multiple patterns as separate arguments.

Specify one or more patterns to be used during the search for input. Patterns in pattern_list must be separated by a NEWLINE character. A null pattern can be specified by two adjacent newline characters in pattern_list. Unless the -E or -F option is also specified, each pattern will be treated as a basic regular expression. Multiple -e and -f options are accepted by grep. All of the specified patterns are used when matching lines, but the order of evaluation is unspecified. Multiple -e and -f options are accepted and grep will use all of the patterns it is given while matching input text lines. (Note that the order of evaluation is not specified. If an implementation finds a null string as a pattern, it is allowed to use that pattern first, matching every line, and effectively ignore any other patterns.)

-E

Match using full regular expressions. Treat each pattern specified as a full regular expression. If any entire full regular expression pattern matches an input line, the line will be matched. A null full regular expression matches every line. Each pattern will be interpreted as a full regular expression as described on the regex(5) manual page, except for \(  and \), and including:

1. A full regular expression followed by +  that matches one or more occurrences of the full regular expression.
2. A full regular expression followed by ?  that matches 0 or 1 occurrences of the full regular expression.
3. Full regular expressions separated by | or by a new-line that match strings that are matched by any of the expressions.
4. A full regular expression that may be enclosed in parentheses () for grouping.

The order of precedence of operators is [], then *?+, then concatenation, then | and new-line.
 

-f pattern_file

Read one or more patterns from the file named by the path name pattern_file. Patterns in pattern_file are terminated by a NEWLINE character. A null pattern can be specified by an empty line in pattern_file. Unless the -E or -F option is also specified, each pattern will be treated as a basic regular expression.

-F

Match using fixed strings. Treat each pattern specified as a string instead of a regular expression. If an input line contains any of the patterns as a contiguous sequence of bytes, the line will be matched. A null string matches every line. See fgrep(1) for more information.

-q

Quiet. Do not write anything to the standard output, regardless of matching lines. Exit with zero status if an input line is selected. The -q option provides a means of easily determining whether or not a pattern (or string) exists in a group of files. When searching several files, it provides a performance improvement (because it can quit as soon as it finds the first match) and requires less care by the user in choosing the set of files to supply as arguments (because it will exit zero if it finds a match even if grep detected an access or read error on earlier file operands).

-x

Consider only input lines that use all characters in the line to match an entire fixed string or regular expression to be matching lines.

Examples

Example 1 Finding all uses of a word

To find all uses of the word "Posix" (in any case) in the file text.mm, and write with line numbers:

example% /usr/bin/fgrep -i -n posix text.mm

Example 2 Finding all empty lines

To find all empty lines in the standard input:

            example% /usr/bin/grep ^$

or

        example% /usr/bin/grep -v .

Example 3 Finding lines containing strings

Both of the following commands print all lines containing strings abc  or def  or both:

example% /usr/xpg4/bin/grep -E 'abc def'

or

example% /usr/xpg4/bin/grep -F 'abc def'

Example 4 Finding lines with matching strings

Both of the following commands print all lines matching exactly abc  or def:

 

example% /usr/xpg4/bin/grep -E '^abc$ ^def$'

or

example% /usr/xpg4/bin/grep -F -x 'abc def'

Environment Variables

See environ(5) for descriptions of the following environment variables that affect the execution of grep: LC_COLLATE, LC_CTYPE, LC_MESSAGES, and NLSPATH.

Exit Status

The following exit values are returned:

0 

One or more matches were found.

1 

No matches were found.

2 

Syntax errors or inaccessible files (even if matches were found).

Solaris 9 Reference Manual Collection >> man pages section 5: Standards, Environments, and Macros >> Standards, Environments, and Macros >> regex(5) - internationalized basic and extended regular expression matching

Regex

regex- internationalized basic and extended regular expression matching

Regular Expressions (REs) provide a mechanism to select specific strings from a set of character strings. The Internationalized Regular Expressions described below differ from the Simple Regular Expressions described on the regexp(5) manual page in the following ways:

• both Basic and Extended Regular Expressions are supported
• the Internationalization features--character class, equivalence class, and multi-character collation--are supported.

The Basic Regular Expression (BRE) notation and construction rules described in the BASIC  REGULAR  EXPRESSIONS  section apply to most utilities supporting regular expressions. Some utilities, instead, support the Extended Regular Expressions (ERE) described in the EXTENDED  REGULAR  EXPRESSIONS  section; any exceptions for both cases are noted in the descriptions of the specific utilities using regular expressions. Both BREs and EREs are supported by the Regular Expression Matching interfaces regcomp(3C) and regexec(3C).

BASIC REGULAR EXPRESSIONS

BREs Matching a Single Character

A BRE ordinary character, a special character preceded by a backslash, or a period matches a single character. A bracket expression matches a single character or a single collating element. See RE Bracket Expression, below.

BRE Ordinary Characters

An ordinary character is a BRE that matches itself: any character in the supported character set, except for the BRE special characters listed in BRE Special Characters, below.

The interpretation of an ordinary character preceded by a backslash (\) is undefined, except for:

1. the characters ), (, {, and }
2. the digits 1 to 9 inclusive (see BREs Matching Multiple Characters, below)
3. a character inside a bracket expression.

BRE Special Characters

A BRE special character has special properties in certain contexts. Outside those contexts, or when preceded by a backslash, such a character will be a BRE that matches the special character itself. The BRE special characters and the contexts in which they have their special meaning are:

. [ \

The period, left-bracket, and backslash are special except when used in a bracket expression (see RE Bracket Expression, below). An expression containing a [ that is not preceded by a backslash and is not part of a bracket expression produces undefined results.

*

The asterisk is special except when used:

• in a bracket expression
• as the first character of an entire BRE (after an initial ^, if any)
• as the first character of a subexpression (after an initial ^, if any); see BREs Matching Multiple Characters, below.

 

^

The circumflex is special when used:

• as an anchor (see BRE Expression Anchoring, below).
• as the first character of a bracket expression (see RE Bracket Expression, below).

 

$

The dollar sign is special when used as an anchor.

Periods in BREs

A period (.), when used outside a bracket expression, is a BRE that matches any character in the supported character set except NUL.

RE Bracket Expression

A bracket expression (an expression enclosed in square brackets, []) is an RE that matches a single collating element contained in the non-empty set of collating elements represented by the bracket expression.

The following rules and definitions apply to bracket expressions:

1. A bracket expression is either a matching list expression or a non-matching list expression. It consists of one or more expressions: collating elements, collating symbols, equivalence classes, character classes, or range expressions (see rule 7 below). Portable applications must not use range expressions, even though all implementations support them. The right-bracket (]) loses its special meaning and represents itself in a bracket expression if it occurs first in the list (after an initial circumflex (^), if any). Otherwise, it terminates the bracket expression, unless it appears in a collating symbol (such as [.].]) or is the ending right-bracket for a collating symbol, equivalence class, or character class. The special characters:

   . * [ \

   (period, asterisk, left-bracket and backslash, respectively) lose their special meaning within a bracket expression.

   [. [= [:

   (left-bracket followed by a period, equals-sign, or colon) are special inside a bracket expression and are used to delimit collating symbols, equivalence class expressions, and character class expressions. These symbols must be followed by a valid expression and the matching terminating sequence .], =] or :], as described in the following items.

    

2. A matching list expression specifies a list that matches any one of the expressions represented in the list. The first character in the list must not be the circumflex. For example, [abc]  is an RE that matches any of the characters a, b  or c.
3. A non-matching list expression begins with a circumflex (^), and specifies a list that matches any character or collating element except for the expressions represented in the list after the leading circumflex. For example, [^abc] is an RE that matches any character or collating element except the characters a,  b, or c. The circumflex will have this special meaning only when it occurs first in the list, immediately following the left-bracket.
4. A collating symbol is a collating element enclosed within bracket-period ([..]) delimiters. Multi-character collating elements must be represented as collating symbols when it is necessary to distinguish them from a list of the individual characters that make up the multi-character collating element. For example, if the string ch  is a collating element in the current collation sequence with the associated collating symbol <ch>, the expression [[.ch.]] will be treated as an RE matching the character sequence ch, while [ch] will be treated as an RE matching c  or h. Collating symbols will be recognized only inside bracket expressions. This implies that the RE [[.ch.]]*c  matches the first to fifth character in the string chchch. If the string is not a collating element in the current collating sequence definition, or if the collating element has no characters associated with it, the symbol will be treated as an invalid expression.
5. An equivalence class expression represents the set of collating elements belonging to an equivalence class. Only primary equivalence classes will be recognised. The class is expressed by enclosing any one of the collating elements in the equivalence class within bracket-equal ([==]) delimiters. For example, if a, and belong to the same equivalence class, then [[=a=]b], [[==]b] and [[==]b] will each be equivalent to [ab]. If the collating element does not belong to an equivalence class, the equivalence class expression will be treated as a collating symbol.
6. A character class expression represents the set of characters belonging to a character class, as defined in the LC_CTYPE  category in the current locale. All character classes specified in the current locale will be recognized. A character class expression is expressed as a character class name enclosed within bracket-colon ([::]) delimiters.

   The following character class expressions are supported in all locales:

    

   [:alnum:]	[:cntrl:]	[:lower:]	[:space:]
   [:alpha:]	[:digit:]	[:print:]	[:upper:]
   [:blank:]	[:graph:]	[:punct:]	[:xdigit:]

    

   In addition, character class expressions of the form:

   [:name:]

   are recognized in those locales where the name keyword has been given a charclass  definition in the LC_CTYPE  category.

    

7. A range expression represents the set of collating elements that fall between two elements in the current collation sequence, inclusively. It is expressed as the starting point and the ending point separated by a hyphen (-).

   Range expressions must not be used in portable applications because their behavior is dependent on the collating sequence. Ranges will be treated according to the current collating sequence, and include such characters that fall within the range based on that collating sequence, regardless of character values. This, however, means that the interpretation will differ depending on collating sequence. If, for instance, one collating sequence defines as a variant of a, while another defines it as a letter following z, then the expression [-z] is valid in the first language and invalid in the second.

   In the following, all examples assume the collation sequence specified for the POSIX locale, unless another collation sequence is specifically defined.

   The starting range point and the ending range point must be a collating element or collating symbol. An equivalence class expression used as a starting or ending point of a range expression produces unspecified results. An equivalence class can be used portably within a bracket expression, but only outside the range. For example, the unspecified expression [[=e=]-f] should be given as [[=e=]e-f]. The ending range point must collate equal to or higher than the starting range point; otherwise, the expression will be treated as invalid. The order used is the order in which the collating elements are specified in the current collation definition. One-to-many mappings (see locale(5)) will not be performed. For example, assuming that the character eszet is placed in the collation sequence after r  and s, but before t, and that it maps to the sequence ss  for collation purposes, then the expression [r-s] matches only r  and s, but the expression [s-t] matches s, beta, or t.

   The interpretation of range expressions where the ending range point is also the starting range point of a subsequent range expression (for instance [a-m-o]) is undefined.

   The hyphen character will be treated as itself if it occurs first (after an initial ^, if any) or last in the list, or as an ending range point in a range expression. As examples, the expressions [-ac] and [ac-] are equivalent and match any of the characters a, c, or -;  [^-ac] and [^ac-] are equivalent and match any characters except a, c, or -; the expression [%--] matches any of the characters between % and - inclusive; the expression [--@] matches any of the characters between - and @ inclusive; and the expression [a--@] is invalid, because the letter a  follows the symbol - in the POSIX locale. To use a hyphen as the starting range point, it must either come first in the bracket expression or be specified as a collating symbol, for example: [][.-.]-0], which matches either a right bracket or any character or collating element that collates between hyphen and 0, inclusive.

   If a bracket expression must specify both - and ], the ] must be placed first (after the ^, if any) and the - last within the bracket expression.

Note: Latin-1 characters such as ` or ^ are not printable in some locales, for example, the ja  locale.

BREs Matching Multiple Characters

The following rules can be used to construct BREs matching multiple characters from BREs matching a single character:

1. The concatenation of BREs matches the concatenation of the strings matched by each component of the BRE.
2. A subexpression can be defined within a BRE by enclosing it between the character pairs \( and \) . Such a subexpression matches whatever it would have matched without the \( and \), except that anchoring within subexpressions is optional behavior; see BRE Expression Anchoring, below. Subexpressions can be arbitrarily nested.
3. The back-reference expression \n matches the same (possibly empty) string of characters as was matched by a subexpression enclosed between \( and \) preceding the \n. The character n must be a digit from 1 to 9 inclusive, nth subexpression (the one that begins with the nth \( and ends with the corresponding paired \)). The expression is invalid if less than n subexpressions precede the \n. For example, the expression ^\(.*\)\1$ matches a line consisting of two adjacent appearances of the same string, and the expression \(a\)*\1 fails to match a. The limit of nine back-references to subexpressions in the RE is based on the use of a single digit identifier. This does not imply that only nine subexpressions are allowed in REs. The following is a valid BRE with ten subexpressions:

   \(\(\(ab\)*c\)*d\)\(ef\)*\(gh\)\{2\}\(ij\)*\(kl\)*\(mn\)*\(op\)*\(qr\)*

    

4. When a BRE matching a single character, a subexpression or a back-reference is followed by the special character asterisk (*), together with that asterisk it matches what zero or more consecutive occurrences of the BRE would match. For example, [ab]*  and  [ab][ab]  are equivalent when matching the string ab.
5. When a BRE matching a single character, a subexpression, or a back-reference is followed by an interval expression of the format \{m\}, \{m,\} or \{m,n\}, together with that interval expression it matches what repeated consecutive occurrences of the BRE would match. The values of m and n will be decimal integers in the range 0 <= m <= n <= {RE_DUP_MAX}, where m specifies the exact or minimum number of occurrences and n specifies the maximum number of occurrences. The expression \{m\} matches exactly m occurrences of the preceding BRE, \{m,\} matches at least m occurrences and \{m,n\} matches any number of occurrences between m and n, inclusive.

   For example, in the string abababccccccd, the BRE c\{3\} is matched by characters seven to nine, the BRE \(ab\)\{4,\} is not matched at all and the BRE c\{1,3\}d is matched by characters ten to thirteen.

The behavior of multiple adjacent duplication symbols (  *  and intervals) produces undefined results.

BRE Precedence

The order of precedence is as shown in the following table:

BRE Precedence (from high to low)
collation-related bracket symbols	[= =] [: :] [. .]
escaped characters	\<special character>
bracket expression	[ ]
subexpressions/back-references	\( \) \n
single-character-BRE duplication	* \{m,n\}
concatenation
anchoring	^ $

 

BRE Expression Anchoring

A BRE can be limited to matching strings that begin or end a line; this is called anchoring. The circumflex and dollar sign special characters will be considered BRE anchors in the following contexts:

1. A circumflex (  ^  )  is an anchor when used as the first character of an entire BRE. The implementation may treat circumflex as an anchor when used as the first character of a subexpression. The circumflex will anchor the expression to the beginning of a string; only sequences starting at the first character of a string will be matched by the BRE. For example, the BRE ^ab matches ab  in the string abcdef,  but fails to match in the string cdefab. A portable BRE must escape a leading circumflex in a subexpression to match a literal circumflex.
2. A dollar sign (  $  )  is an anchor when used as the last character of an entire BRE. The implementation may treat a dollar sign as an anchor when used as the last character of a subexpression. The dollar sign will anchor the expression to the end of the string being matched; the dollar sign can be said to match the end-of-string following the last character.
3. A BRE anchored by both ^  and $  matches only an entire string. For example, the BRE ^abcdef$  matches strings consisting only of abcdef.
4. ^  and $  are not special in subexpressions.

Note: The Solaris implementation does not support anchoring in BRE subexpressions.

EXTENDED REGULAR EXPRESSIONS

The rules specififed for BREs apply to Extended Regular Expressions (EREs) with the following exceptions:

• The characters |, +, and ?  have special meaning, as defined below.
• The {  and }  characters, when used as the duplication operator, are not preceded by backslashes. The constructs \{  and \}  simply match the characters {  and }, respectively.
• The back reference operator is not supported.
• Anchoring (^$) is supported in subexpressions.

EREs Matching a Single Character

An ERE ordinary character, a special character preceded by a backslash, or a period matches a single character. A bracket expression matches a single character or a single collating element. An ERE matching a single character enclosed in parentheses matches the same as the ERE without parentheses would have matched.

ERE Ordinary Characters

An ordinary character is an ERE that matches itself. An ordinary character is any character in the supported character set, except for the ERE special characters listed in ERE  Special  Characters  below. The interpretation of an ordinary character preceded by a backslash (\) is undefined.

ERE Special Characters

An ERE special character has special properties in certain contexts. Outside those contexts, or when preceded by a backslash, such a character is an ERE that matches the special character itself. The extended regular expression special characters and the contexts in which they have their special meaning are:

. [ \ (

The period, left-bracket, backslash, and left-parenthesis are special except when used in a bracket expression (see RE Bracket Expression, above). Outside a bracket expression, a left-parenthesis immediately followed by a right-parenthesis produces undefined results.

)

The right-parenthesis is special when matched with a preceding left-parenthesis, both outside a bracket expression.

* + ? {

The asterisk, plus-sign, question-mark, and left-brace are special except when used in a bracket expression (see RE Bracket Expression, above). Any of the following uses produce undefined results:

• if these characters appear first in an ERE, or immediately following a vertical-line, circumflex or left-parenthesis
• if a left-brace is not part of a valid interval expression.

 

|

The vertical-line is special except when used in a bracket expression (see RE Bracket Expression, above). A vertical-line appearing first or last in an ERE, or immediately following a vertical-line or a left-parenthesis, or immediately preceding a right-parenthesis, produces undefined results.

^

The circumflex is special when used:

• as an anchor (see ERE Expression Anchoring, below).
• as the first character of a bracket expression (see RE Bracket Expression, above).

 

$

The dollar sign is special when used as an anchor.

Periods in EREs

A period (.), when used outside a bracket expression, is an ERE that matches any character in the supported character set except NUL.

ERE Bracket Expression

The rules for ERE Bracket Expressions are the same as for Basic Regular Expressions; see RE Bracket Expression, above).

EREs Matching Multiple Characters

The following rules will be used to construct EREs matching multiple characters from EREs matching a single character:

1. A concatenation of EREs matches the concatenation of the character sequences matched by each component of the ERE. A concatenation of EREs enclosed in parentheses matches whatever the concatenation without the parentheses matches. For example, both the ERE cd and the ERE (cd)  are matched by the third and fourth character of the string abcdefabcdef.
2. When an ERE matching a single character or an ERE enclosed in parentheses is followed by the special character plus-sign (+), together with that plus-sign it matches what one or more consecutive occurrences of the ERE would match. For example, the ERE b+(bc)  matches the fourth to seventh characters in the string acabbbcde;  [ab]  + and [ab][ab]*  are equivalent.
3. When an ERE matching a single character or an ERE enclosed in parentheses is followed by the special character asterisk (*), together with that asterisk it matches what zero or more consecutive occurrences of the ERE would match. For example, the ERE b*c  matches the first character in the string cabbbcde,  and the ERE b*cd  matches the third to seventh characters in the string cabbbcdebbbbbbcdbc. And, [ab]*  and [ab][ab]  are equivalent when matching the string ab.
4. When an ERE matching a single character or an ERE enclosed in parentheses is followed by the special character question-mark (?), together with that question-mark it matches what zero or one consecutive occurrences of the ERE would match. For example, the ERE b?c  matches the second character in the string acabbbcde.
5. When an ERE matching a single character or an ERE enclosed in parentheses is followed by an interval expression of the format {m}, {m,} or {m,n}, together with that interval expression it matches what repeated consecutive occurrences of the ERE would match. The values of m and n will be decimal integers in the range 0 <= m <= n <= {RE_DUP_MAX}, where m specifies the exact or minimum number of occurrences and n specifies the maximum number of occurrences. The expression {m} matches exactly m occurrences of the preceding ERE, {m,} matches at least m occurrences and {m,n} matches any number of occurrences between m and n, inclusive.

---

For example, in the string abababccccccd  the ERE c{3} is matched by characters seven to nine and the ERE (ab){2,} is matched by characters one to six.

---

The behavior of multiple adjacent duplication symbols (+,  *, ?  and intervals) produces undefined results.

ERE Alternation

Two EREs separated by the special character vertical-line (|) match a string that is matched by either. For example, the ERE a((bc)|d) matches the string abc and the string ad. Single characters, or expressions matching single characters, separated by the vertical bar and enclosed in parentheses, will be treated as an ERE matching a single character.

ERE Precedence

The order of precedence will be as shown in the following table:

ERE Precedence (from high to low)
collation-related bracket symbols	[= =] [: :] [. .]
escaped characters	\<special character>
bracket expression	[ ]
grouping	( )
single-character-ERE duplication	* + ? {m,n}
concatenation
anchoring	^ $
alternation	|

 

 

For example, the ERE abba|cde  matches either the string abba  or the string cde  (rather than the string abbade  or abbcde, because concatenation has a higher order of precedence than alternation).

ERE Expression Anchoring

An ERE can be limited to matching strings that begin or end a line; this is called anchoring. The circumflex and dollar sign special characters are considered ERE anchors when used anywhere outside a bracket expression. This has the following effects:

1. A circumflex (^) outside a bracket expression anchors the expression or subexpression it begins to the beginning of a string; such an expression or subexpression can match only a sequence starting at the first character of a string. For example, the EREs ^ab and (^ab) match ab in the string abcdef, but fail to match in the string cdefab, and the ERE a^b is valid, but can never match because the a  prevents the expression ^b from matching starting at the first character.
2. A dollar sign (  $  )  outside a bracket expression anchors the expression or subexpression it ends to the end of a string; such an expression or subexpression can match only a sequence ending at the last character of a string. For example, the EREs ef$ and (ef$) match ef in the string abcdef, but fail to match in the string cdefab, and the ERE e$f is valid, but can never match because the f  prevents the expression e$ from matching ending at the last character.

In Solaris there are only basic and extended version of grep (egrep).  Ironically, despite the origin of the name (extended), Solaris egrep actually has less functionality that GNU grep with -P option.  A better way to is to replace Solaris grep with GNU grep which implements -P option. 

Fgrep -- fast grep

Following is the general format of the fgrep command.

     fgrep [ -bchilnvx ] [ -e -string ] string file_list
     fgrep [ -bchilnvx ] [ -e -string ] -f file file_list

Options

The following list describes the options and their arguments that may be used to control how fgrep functions.

Regular Expressions Reference Sheet

Etc

Society

Groupthink : Two Party System as Polyarchy : Corruption of Regulators : Bureaucracies : Understanding Micromanagers and Control Freaks : Toxic Managers :   Harvard Mafia : Diplomatic Communication : Surviving a Bad Performance Review : Insufficient Retirement Funds as Immanent Problem of Neoliberal Regime : PseudoScience : Who Rules America : Neoliberalism  : The Iron Law of Oligarchy : Libertarian Philosophy

Quotes

War and Peace : Skeptical Finance : John Kenneth Galbraith :Talleyrand : Oscar Wilde : Otto Von Bismarck : Keynes : George Carlin : Skeptics : Propaganda  : SE quotes : Language Design and Programming Quotes : Random IT-related quotes :  Somerset Maugham : Marcus Aurelius : Kurt Vonnegut : Eric Hoffer : Winston Churchill : Napoleon Bonaparte : Ambrose Bierce :  Bernard Shaw : Mark Twain Quotes

Bulletin:

Vol 25, No.12 (December, 2013) Rational Fools vs. Efficient Crooks The efficient markets hypothesis : Political Skeptic Bulletin, 2013 : Unemployment Bulletin, 2010 :  Vol 23, No.10 (October, 2011) An observation about corporate security departments : Slightly Skeptical Euromaydan Chronicles, June 2014 : Greenspan legacy bulletin, 2008 : Vol 25, No.10 (October, 2013) Cryptolocker Trojan (Win32/Crilock.A) : Vol 25, No.08 (August, 2013) Cloud providers as intelligence collection hubs : Financial Humor Bulletin, 2010 : Inequality Bulletin, 2009 : Financial Humor Bulletin, 2008 : Copyleft Problems Bulletin, 2004 : Financial Humor Bulletin, 2011 : Energy Bulletin, 2010 : Malware Protection Bulletin, 2010 : Vol 26, No.1 (January, 2013) Object-Oriented Cult : Political Skeptic Bulletin, 2011 : Vol 23, No.11 (November, 2011) Softpanorama classification of sysadmin horror stories : Vol 25, No.05 (May, 2013) Corporate bullshit as a communication method  : Vol 25, No.06 (June, 2013) A Note on the Relationship of Brooks Law and Conway Law

History:

Fifty glorious years (1950-2000): the triumph of the US computer engineering : Donald Knuth : TAoCP and its Influence of Computer Science : Richard Stallman : Linus Torvalds  : Larry Wall  : John K. Ousterhout : CTSS : Multix OS Unix History : Unix shell history : VI editor : History of pipes concept : Solaris : MS DOS :  Programming Languages History : PL/1 : Simula 67 : C : History of GCC development :  Scripting Languages : Perl history   : OS History : Mail : DNS : SSH : CPU Instruction Sets : SPARC systems 1987-2006 : Norton Commander : Norton Utilities : Norton Ghost : Frontpage history : Malware Defense History : GNU Screen : OSS early history

Classic books:

The Peter Principle : Parkinson Law : 1984 : The Mythical Man-Month :  How to Solve It by George Polya : The Art of Computer Programming : The Elements of Programming Style : The Unix Hater�s Handbook : The Jargon file : The True Believer : Programming Pearls : The Good Soldier Svejk : The Power Elite

Most popular humor pages:

Manifest of the Softpanorama IT Slacker Society : Ten Commandments of the IT Slackers Society : Computer Humor Collection : BSD Logo Story : The Cuckoo's Egg : IT Slang : C++ Humor : ARE YOU A BBS ADDICT? : The Perl Purity Test : Object oriented programmers of all nations : Financial Humor : Financial Humor Bulletin, 2008 : Financial Humor Bulletin, 2010 : The Most Comprehensive Collection of Editor-related Humor : Programming Language Humor : Goldman Sachs related humor : Greenspan humor : C Humor : Scripting Humor : Real Programmers Humor : Web Humor : GPL-related Humor : OFM Humor : Politically Incorrect Humor : IDS Humor : "Linux Sucks" Humor : Russian Musical Humor : Best Russian Programmer Humor : Microsoft plans to buy Catholic Church : Richard Stallman Related Humor : Admin Humor : Perl-related Humor : Linus Torvalds Related humor : PseudoScience Related Humor : Networking Humor : Shell Humor : Financial Humor Bulletin, 2011 : Financial Humor Bulletin, 2012 : Financial Humor Bulletin, 2013 : Java Humor : Software Engineering Humor : Sun Solaris Related Humor : Education Humor : IBM Humor : Assembler-related Humor : VIM Humor : Computer Viruses Humor : Bright tomorrow is rescheduled to a day after tomorrow : Classic Computer Humor

The Last but not Least Technology is dominated by two types of people: those who understand what they do not manage and those who manage what they do not understand ~Archibald Putt. Ph.D

The statements, views and opinions presented on this web page are those of the author (or referenced source) and are not endorsed by, nor do they necessarily reflect, the opinions of the Softpanorama society. We do not warrant the correctness of the information provided or its fitness for any purpose. The site uses AdSense so you need to be aware of Google privacy policy. You you do not want to be tracked by Google please disable Javascript for this site. This site is perfectly usable without Javascript.

Last modified: March 12, 2019