Lib/regular expression - Revision history

Hzwakenberg: /* Coming soon? */

2016-06-20T06:54:57Z

Coming soon?

← Older revision		Revision as of 08:54, 20 June 2016
Line 47:		Line 47:
	* The JAVA regular expressions (help wanted, trick inherit PERL5 builder and make the hungry repetition)		* The JAVA regular expressions (help wanted, trick inherit PERL5 builder and make the hungry repetition)

−	''If you want to look ~~forwards~~, consider implementing Perl 6 regular expressions (now called Perl 6 rules, because they go so far beyond regexps). Perl 6 rules combine traditional regexps with parsing grammars, eliminating the use for tools such as lex/yacc. Here are some details:''	+	''If you want to look forward, consider implementing Perl 6 regular expressions (now called Perl 6 rules, because they go so far beyond regexps). Perl 6 rules combine traditional regexps with parsing grammars, eliminating the use for tools such as lex/yacc. Here are some details:''

	* Larry Wall's explanation of the changes: http://dev.perl.org/perl6/doc/design/apo/A05.html<br>		* Larry Wall's explanation of the changes: http://dev.perl.org/perl6/doc/design/apo/A05.html<br>

Dkearns: s/LibertyEiffel/Liberty Eiffel/

2016-06-16T11:37:19Z

s/LibertyEiffel/Liberty Eiffel/

← Older revision		Revision as of 13:37, 16 June 2016
Line 1:		Line 1:
	[[Category: Library]]		[[Category: Library]]
−	== Regular expressions in ~~LibertyEiffel~~ ==	+	== Regular expressions in Liberty Eiffel ==
−	In ~~LibertyEiffel~~, a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.	+	In Liberty Eiffel, a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.

	Currently the regular expression cluster makes use of the backtracking cluster.		Currently the regular expression cluster makes use of the backtracking cluster.

Hzwakenberg at 10:47, 7 September 2014

2014-09-07T10:47:20Z

← Older revision		Revision as of 12:47, 7 September 2014
Line 1:		Line 1:
		+	[[Category: Library]]
	== Regular expressions in LibertyEiffel ==		== Regular expressions in LibertyEiffel ==
	In LibertyEiffel, a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.		In LibertyEiffel, a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.

Hzwakenberg at 19:13, 5 September 2014

2014-09-05T19:13:35Z

← Older revision		Revision as of 21:13, 5 September 2014
Line 1:		Line 1:
		+	== Regular expressions in LibertyEiffel ==
−	[[Category:Smarteiffel]]
		+	In LibertyEiffel, a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.
−	== Regular expressions in SmartEiffel 2.2 ==
−
−	As from version 2.2 of SmartEiffel, a cluster is included that allows you to use either
−	POSIX regular expressions or PERL5 regular expressions.

	Currently the regular expression cluster makes use of the backtracking cluster.		Currently the regular expression cluster makes use of the backtracking cluster.

Ramack at 21:33, 5 March 2013

2013-03-05T21:33:07Z

← Older revision		Revision as of 23:33, 5 March 2013
Line 1:		Line 1:
−	[[Category:~~SmartEiffel~~]]	+	[[Category:Smarteiffel]]
	== Regular expressions in SmartEiffel 2.2 ==		== Regular expressions in SmartEiffel 2.2 ==

Ramack at 20:55, 4 March 2013

2013-03-04T20:55:34Z

← Older revision		Revision as of 22:55, 4 March 2013
Line 1:		Line 1:
		+	[[Category:SmartEiffel]]
	== Regular expressions in SmartEiffel 2.2 ==		== Regular expressions in SmartEiffel 2.2 ==

Ramack: 11 revisions: initial import from SamrtEiffel Wiki - The Grand SmartEiffel Book

2013-03-03T21:04:58Z

11 revisions: initial import from SamrtEiffel Wiki - The Grand SmartEiffel Book

New page

== Regular expressions in SmartEiffel 2.2 ==

As from version 2.2 of SmartEiffel, a cluster is included that allows you to use either
POSIX regular expressions or PERL5 regular expressions.

Currently the regular expression cluster makes use of the backtracking cluster.

The main restriction comes from the character set used; this is the ASCII character set.
UNICODE characters are not supported at the moment.

Another restriction is that most of the common character escapes do not work:
\n is a literal n, not new line; \t is a literal t, not tab; etc.. The reason is that we thought that
users could do such preprocessing themselves, and we had a schizophrenic conflict
between %N and \n. Your opinion about that point is very welcome.

Known problems:
* The construct <TT>(a?b?)*</TT> causes an infinite loop and crashes with a stack overflow.
* The construct <TT>(a+)+</TT> can use so much CPU that you believe that it is buggy.
* The construct <TT>(a(b)?)*</TT> applied on <TT>aba</TT> will give you a group 2 not empty, beginning at 2 and finishing at 2.

As always, see the tutorial to learn how to use regular expressions.

== The POSIX regular expressions ==

The POSIX regular expression are supported except for the [=...=] construct (same class that ...).

See POSIX 1003.2, section 2.8 (Regular Expression Notation). [http://www.unix.org/ www.unix.org]

On LINUX: man 7 regex.

== The PERL 5 regular expressions ==

With the main restriction that UNICODE is not handled, most of the PERL 5 regular expressions is implemented.
See [http://perldoc.perl.org/perlre.html Perl Regular expressions].

Missing things:
* The experimental behaviours are not integrated
* Some construct like [[:] that are well interpreted by perl produce an error. In these cases, you must write [:[].

Added things:
* The look behind (negative or positive) is not restricted to have a fixed length.
* The POSIX constructs [:<:] and [:>:] are allowed (it stands for begin and end of words).

== Coming soon? ==

* The shell (bash) file matching (help wanted)
* The basic regular expression (help wanted)
* The JAVA regular expressions (help wanted, trick inherit PERL5 builder and make the hungry repetition)

''If you want to look forwards, consider implementing Perl 6 regular expressions (now called Perl 6 rules, because they go so far beyond regexps). Perl 6 rules combine traditional regexps with parsing grammars, eliminating the use for tools such as lex/yacc. Here are some details:''

* Larry Wall's explanation of the changes: http://dev.perl.org/perl6/doc/design/apo/A05.html<br>

* Damian Conway's specification of Perl 6 rules: http://dev.perl.org/perl6/doc/design/exe/E05.html

* Patrick Michaud's tutorial (assumes knowledge of Perl 5 regexps): http://dev.perl.org/perl6/doc/design/syn/S05.html

* IBM overview of Perl 6 Rules: http://www-128.ibm.com/developerworks/linux/library/l-cpregex.html?ca=dgr-lnxw01Perl6Gram

[[User:Eiffel|Roger Browne]] 23:12, 4 Dec 2005 (CET)

201.252.190.101: typos, grammar

2005-12-07T17:00:14Z

typos, grammar

New page

== Regular expressions of SmartEiffel 2.2 ==

Since SmartEiffel 2.2 a cluster is included that allows you to use either POSIX regular expressions or PERL5 regular expressions.

Currently the regular expression cluster makes use of the backtracking cluster.

The main restriction comes from the character set used. The used one is the ASCII character set. UNICODE characters are not supported currently.

Another restriction is that most of the common character escapes are not made: \n is n not new line, \t is t not tab, etc.. The reason is that we supposed that such a preprocessing can be made by users and we had a schizophrenic conflict between %N and \n. Your opinion about that point is very welcome.

Known problems:
* The construct (a?b?)* gives an infinite loop and fills the stack until crash.
* The construct (a+)+ can use so much CPU that you believe that it is buggy.
* The construct (a(b)?)* applied on aba will give you a group 2 not empty, beginning at 2 and finishing at 2.

As always, see the tutorial to learn how to use regular expressions.

== The POSIX regular expressions ==

The POSIX regular expression are supported except for the [=...=] construct (same class that ...).

See POSIX 1003.2, section 2.8 (Regular Expression Notation). [http://www.unix.org/ www.unix.org]

On LINUX: man 7 regex.

== The PERL 5 regular expressions ==

With the main restriction that UNICODE is not handled, most of the PERL 5 regular expressions is implemented.
See [http://perldoc.perl.org/perlre.html Perl Regular expressions].

Missing things:
* The experimental behaviours are not integrated
* Some construct like [[:] that are well interpreted by perl produce an error. In these cases, you must write [:[].

Added things:
* The look behind (negative or positive) is not restricted to have a fixed length.
* The POSIX constructs [:<:] and [:>:] are allowed (it stands for begin and end of words).

== Coming soon? ==

* The shell (bash) file matching (help wanted)
* The basic regular expression (help wanted)
* The JAVA regular expressions (help wanted, trick inherit PERL5 builder and make the hungry repetition)

''If you want to look forwards, consider implementing Perl 6 regular expressions (now called Perl 6 rules, because they go so far beyond regexps). Perl 6 rules combine traditional regexps with parsing grammars, eliminating the use for tools such as lex/yacc. Here are some details:''

* Larry Wall's explanation of the changes: http://dev.perl.org/perl6/doc/design/apo/A05.html<br>

* Damian Conway's specification of Perl 6 rules: http://dev.perl.org/perl6/doc/design/exe/E05.html

* Patrick Michaud's tutorial (assumes knowledge of Perl 5 regexps): http://dev.perl.org/perl6/doc/design/syn/S05.html

* IBM overview of Perl 6 Rules: http://www-128.ibm.com/developerworks/linux/library/l-cpregex.html?ca=dgr-lnxw01Perl6Gram

[[User:Eiffel|Roger Browne]] 23:12, 4 Dec 2005 (CET)

80.170.7.104 at 13:16, 28 November 2005

2005-11-28T13:16:41Z

← Older revision		Revision as of 15:16, 28 November 2005
Line 13:		Line 13:
	* The construct (a+)+ can use so much CPU that you believe that it is buggy.		* The construct (a+)+ can use so much CPU that you believe that it is buggy.
	* The construct (a(b)?)* applied on aba will give you a group 2 not empty, beginning at 2 and finishing at 2.		* The construct (a(b)?)* applied on aba will give you a group 2 not empty, beginning at 2 and finishing at 2.
		+
		+	As always, see the tutorial to learn how to use regular expressions.

	== The POSIX regular expressions ==		== The POSIX regular expressions ==

80.170.7.104 at 13:15, 28 November 2005

2005-11-28T13:15:29Z

New page

== Regular expressions of SmartEiffel 2.2 ==

Since SmartEiffel 2.2 a cluster is included that allow you to use either POSIX regular expressions or PERL5 regular expressions.

Currently the regular expression cluster makes use of the backtracking cluster.

The main restriction comes from used the character set. The used one is the ASCII character set. UNICODE characters are not supported currently.

An other restriction is that most of the common character escapes are not made: \n is n not new line, \t is t not tab, etc.. The reason is that we supposed that such a preprocessing can be made by users and we had a schizophrenic conflict between %N and \n. Your opinion about that point is very wellcome.

Known problems:
* The constructs (a?b?)* gives an infinite loop and fills the stack until crash.
* The construct (a+)+ can use so much CPU that you believe that it is buggy.
* The construct (a(b)?)* applied on aba will give you a group 2 not empty, beginning at 2 and finishing at 2.

== The POSIX regular expressions ==

The POSIX regular expression are supported except for the [=...=] construct (same class that ...).

See POSIX 1003.2, section 2.8 (Regular Expression Notation). [http://www.unix.org/ www.unix.org]

On LINUX: man 7 regex.

== The PERL 5 regular expressions ==

With the main restriction that UNICODE is not handled, most of the PERL 5 regular expressions is implemented.
See [http://perldoc.perl.org/perlre.html Perl Regular expressions].

Missing things:
* The experimental behaviours are not integrated
* Some construct like [[:] that are well interpreted by perl produce an error. In these cases, you must write [:[].

Added things:
* The look behind (negative or positive) is not restricted to have a fixed length.
* The POSIX constructs [:<:] and [:>:] are allowed (it stands for begin and end of words).

== Coming soon? ==

* The shell (bash) file matching (help wanted)
* The basic regular expression (help wanted)
* The JAVA regular expressions (help wanted, trick inherit PERL5 builder and make the hungry repetition)