Recent changes to Home

WikiPage Home modified by Bjorn Reese

Bjorn Reese — Sun, 05 Feb 2012 10:59:17 -0000

--- v19 
+++ v20 
@@ -34,10 +34,16 @@
 
 #### Examples ####
 
-* Match a vowel:
-
-
+* Match a single vowel:
+

+
 rule vowel = group("AEIOUYaeiouy");
+
+

+* Match a one or more vowels:
+
+
+rule vowels = +vowel;
 
 
 * Match identifier (alphabetic character followed by zero or more alphanumeric characters):



WikiPage Home modified by Bjorn Reese
Bjorn Reese — Sun, 18 Sep 2011 09:16:57 -0000
--- v18 
+++ v19 
@@ -1,59 +1,61 @@
 BNFA is C++ regular expression matcher based on [non-deterministic finite automata](http://en.wikipedia.org/wiki/Nondeterministic_finite-state_machine) (NFA).
 
+BNFA provides a way to construct the regular expression rules, and an engine for comparing input against the regular expressions.
+
 ### Rules ###
 BNFA uses overloaded operators for writing regular expressions. This syntax was inspired by [Boost.Spirit](http://www.boost.org/doc/libs/).
 
 
 
 Element Regular expression BNFA
 
 
 Optional A? -A
 One-or-more A+ +A
 Zero-or-more A* *A
 Exactly N times A{N} A(N)
 At least N times A{N,} A(N,infinity)
 Between M and N times A{M,N} A(M,N)
 Concatenation AB A >> B
 Alternation A | B A | B
 Separated list A(?:BA)* A % B
 Capture (A) capture(A)
 Positive lookahead (?=A) &A
 Negative lookahead (?!A) !A
 Character a text("a")
 Any character . any()
 Character sequence abc text("abc")
 Character group [abc] group("abc")
 Character range [a-z] range('a', 'z')
 Character class [:alnum:]
[:alpha:]
... alnum()
alpha()
...
 
 
 
 
 #### Examples ####
 
 * Match a vowel:
 
 
 rule vowel = group("AEIOUYaeiouy");
 
 
 * Match identifier (alphabetic character followed by zero or more alphanumeric characters):
 
 
 rule identifier1 = alpha() >> *alnum(); // Alternative #1

 rule identifier2 = !digit() >> +alnum(); // Alternative #2
 
 
 * Matching a floating point number can be done with the regular expression [\[+-\]?(\[0-9\]*\\.\[0-9\]+|\[0-9\]+)](http://www.regular-expressions.info/floatingpoint.html):
 
 
 rule floating = -group("+-") >> ( ( *digit() >> text(".") >> +digit() ) | +digit() );
 
 

 
 ### Matching Policies ###
-BNFA has three different matching policies:
+The BNFA engine supports three different matching policies:
 
 * Match - Examines if the input matched the rule.
 * Capture - Returns a list with parts of the input that matches the captures specified in the rule.

Element	Regular expression	BNFA
Optional	A?	`-A`
One-or-more	A+	`+A`
Zero-or-more	A*	`*A`
Exactly N times	A{N}	`A(N)`
At least N times	A{N,}	`A(N,infinity)`
Between M and N times	A{M,N}	`A(M,N)`
Concatenation	AB	`A >> B`
Alternation	A \| B	`A \| B`
Separated list	A(?:BA)*	`A % B`
Capture	(A)	`capture(A)`
Positive lookahead	(?=A)	`&A`
Negative lookahead	(?!A)	`!A`
Character	a	`text("a")`
Any character	.	`any()`
Character sequence	abc	`text("abc")`
Character group	[abc]	`group("abc")`
Character range	[a-z]	`range('a', 'z')`
Character class	[:alnum:] [:alpha:] ...	`alnum() alpha()` ...


WikiPage Home modified by Bjorn Reese
Bjorn Reese — Sun, 18 Sep 2011 09:12:46 -0000

--- v17 
+++ v18 
@@ -51,3 +51,10 @@
 rule floating = -group("+-") >> ( ( *digit() >> text(".") >> +digit() ) | +digit() );
 
 
+
+### Matching Policies ###
+BNFA has three different matching policies:
+
+* Match - Examines if the input matched the rule.
+* Capture - Returns a list with parts of the input that matches the captures specified in the rule.
+* Lookup - Look up data that matches the input. This works like a radix tree, but where the radix tree only handles prefixes, this matcher handles arbitrary regular expressions.

WikiPage Home modified by Bjorn Reese

Bjorn Reese — Sun, 18 Sep 2011 08:59:37 -0000

--- v16 
+++ v17 
@@ -1,4 +1,4 @@
-BNFA is C++ regular expression matcher based on non-deterministic finite automata (NFA).
+BNFA is C++ regular expression matcher based on [non-deterministic finite automata](http://en.wikipedia.org/wiki/Nondeterministic_finite-state_machine) (NFA).
 
 ### Rules ###
 BNFA uses overloaded operators for writing regular expressions. This syntax was inspired by [Boost.Spirit](http://www.boost.org/doc/libs/).

WikiPage Home modified by Bjorn Reese

Bjorn Reese — Thu, 18 Aug 2011 17:54:08 -0000

--- v15 
+++ v16 
@@ -17,9 +17,9 @@
 ConcatenationABA >> B
 AlternationA | BA | B
 Separated listA(?:BA)*A % B
-Capture(A)capture(A)
-Positive lookahead(?=A)&A
-Negative lookahead(?!A)!A
+Capture(A)capture(A)
+Positive lookahead(?=A)&A
+Negative lookahead(?!A)!A
 Characteratext("a")
 Any character.any()
 Character sequenceabctext("abc")



WikiPage Home modified by Bjorn Reese
Bjorn Reese — Thu, 18 Aug 2011 17:38:48 -0000
--- v14 
+++ v15 
@@ -16,7 +16,8 @@
 Between M and N timesA{M,N}A(M,N)
 ConcatenationABA >> B
 AlternationA | BA | B
-Separated listA(BA)*A % B
+Separated listA(?:BA)*A % B
+Capture(A)capture(A)
 Positive lookahead(?=A)&A
 Negative lookahead(?!A)!A
 Characteratext("a")



WikiPage Home modified by Bjorn Reese
Bjorn Reese — Mon, 15 Aug 2011 17:52:32 -0000
--- v13 
+++ v14 
@@ -31,24 +31,22 @@
 
 #### Examples ####
 
-* Match alphabetic letters with \[A-Za-z\]:
-
-
-rule alpha = range('A', 'Z') | range('a', 'z');
-
-
+* Match a vowel:
+
+
+rule vowel = group("AEIOUYaeiouy");
+
+
 * Match identifier (alphabetic character followed by zero or more alphanumeric characters):
 
 
-rule digit = range('0', '9');

-rule alnum = digit | alpha;

-rule identifier1 = alpha >> *alnum; // Alternative #1

-rule identifier2 = !digit >> +alnum; // Alternative #2
+rule identifier1 = alpha() >> *alnum(); // Alternative #1

+rule identifier2 = !digit() >> +alnum(); // Alternative #2
 
 
 * Matching a floating point number can be done with the regular expression [\[+-\]?(\[0-9\]*\\.\[0-9\]+|\[0-9\]+)](http://www.regular-expressions.info/floatingpoint.html):
 
 
-rule floating = -group("+-") >> ( ( *digit >> text(".") >> +digit ) | +digit );
+rule floating = -group("+-") >> ( ( *digit() >> text(".") >> +digit() ) | +digit() );
 
 




WikiPage Home modified by Bjorn Reese
Bjorn Reese — Mon, 15 Aug 2011 17:48:49 -0000
--- v12 
+++ v13 
@@ -24,6 +24,7 @@
 Character sequenceabctext("abc")
 Character group[abc]group("abc")
 Character range[a-z]range('a', 'z')
+Character class[:alnum:]
[:alpha:]
...alnum()
alpha()
...
 
 
 



WikiPage Home modified by Bjorn Reese
Bjorn Reese — Mon, 15 Aug 2011 16:47:55 -0000
--- v11 
+++ v12 
@@ -33,13 +33,21 @@
 * Match alphabetic letters with \[A-Za-z\]:
 
 
-rule alphabetic = range('A', 'Z') | range('a', 'z');
-
-
+rule alpha = range('A', 'Z') | range('a', 'z');
+
+
+* Match identifier (alphabetic character followed by zero or more alphanumeric characters):
+
+
+rule digit = range('0', '9');

+rule alnum = digit | alpha;

+rule identifier1 = alpha >> *alnum; // Alternative #1

+rule identifier2 = !digit >> +alnum; // Alternative #2
+
+
 * Matching a floating point number can be done with the regular expression [\[+-\]?(\[0-9\]*\\.\[0-9\]+|\[0-9\]+)](http://www.regular-expressions.info/floatingpoint.html):
 
 
-rule digit = range('0', '9');

 rule floating = -group("+-") >> ( ( *digit >> text(".") >> +digit ) | +digit );
 
 




WikiPage Home modified by Bjorn Reese
Bjorn Reese — Sun, 14 Aug 2011 16:11:23 -0000
--- v10 
+++ v11 
@@ -12,6 +12,7 @@
 One-or-moreA++A
 Zero-or-moreA**A
 Exactly N timesA{N}A(N)
+At least N timesA{N,}A(N,infinity)
 Between M and N timesA{M,N}A(M,N)
 ConcatenationABA >> B
 AlternationA | BA | B