Siteadmin, Check users, nsTeam1RO, nsTeam1RW, nsTeam1_talkRO, nsTeam1_talkRW, oversight, Administrators
30,650
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: − A '''regular expression''' is particular instance of a non-[[deterministic]] [[finite]] state [[automaton]]. Regular expressions are a [[type-3 grammar]] in the [[Chomsky hierarchy]] of [[language]]. − − == Overview == −
remove useless jargon
A regular expression is read from left to right and is processed one piece at a time. Certain characters have special meanings within the description of a regular language:
A regular expression is read from left to right and is processed one piece at a time. Certain characters have special meanings within the description of a regular language:
* '*' - the previous construction is matched 0 or more times
* '*' - the previous construction is matched 0 or more times