1,129
edits
Changes
Jump to navigation
Jump to search
mLine 1:
Line 1: + +
breaking up top section
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]].
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 ==
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: