0
a period means 'any single character'. A period followed by an asterisk means 'zero or more characters'.
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
What is the question mark symbol used for in Linux regular expressions?
Single-letter matching wild cards. Example: d?g could be dog, dig, or dug, but NOT dang, dragging, drug, dung, or digging.
What is the asterisk symbol used for in Linux regular expressions?
The asterisk symbol means 0 to many repetitions of the expression it follows. This means the regular expression "do*g" would match "dg", "dog", "doog", "dooog", ... or "(?>do)*g" would match "g", "dog", "dodog", "dododog", ...
How do you use regular expression in web mining?
Regular expressions can be used to find patterns within data. Beyond that the subject of Regular expressions gets extremely complicated very fast, I suggest you purchase a book on the subject and read it... twice.. http://www.amazon.com/Mastering-Regular-Expressions-Jeffrey-Friedl/dp/0596528124/ref=sr_1_1?ie=UTF8&qid=1345423498&sr=8-1&keywords=regular+expressions
What is the period used for in a regular expression?
to stop a sentence
Can Linux be used as a mainframe?
Yes, Linux can be used on a mainframe.
What is used to to designate the transition phase between regular menstrul period and no period at all is?
Perimenopausal
How many terms are used as expressions?
There is no limit to the number of terms that are used as expressions.
What is Red Hat Enterprise Linux used for?
red hat enterprise Linux is used as a server while red hat Linux is used as client..
What is the name of the kernel used in Linux?
Linux is the kernel.
What was the first Linux application?
I think it was the Linux kernel. There are many used with Linux now.
What was the first shell used by Linux and Unix that used commands entered at a command prompt?
The very first one, period. The first shell for Unix didn't originally have a name but has since been referred to as the Thompson shell. The first shell ported to Linux was bash.
Describe how lexical analyzer generators are used to translate regular expressions into deterministic finite automata?
Lexical analyzer generators translate regular expressions (the lexical analyzer definition) into finite automata (the lexical analyzer). For example, a lexical analyzer definition may specify a number of regular expressions describing different lexical forms (integer, string, identifier, comment, etc.). The lexical analyzer generator would then translate that definition into a program module that can use the deterministic finite automata to analyze text and split it into lexemes (tokens).
