Trivial scheme cleanups

1 files changed, 3 insertions, 1 deletions

diff --git a/bs/re.scm b/bs/re.scm
index ec5b2ba..46cfa9e 100644
--- a/bs/re.scm
+++ b/bs/re.scm
@@ -1,4 +1,4 @@
-(library (bs re (0))
+(library (bs re)
 
   ;; Similar to Python's `re` module. One big difference is that the
   ;; string object to be searched is always the first argument to a
@@ -16,6 +16,7 @@
   ;; TODO: make `match` and `search` do different things
 
   (export match group sub search compile
+          EXTENDED
           ;; I IGNORECASE M MULTILINE
           )
   (import (rnrs base)
@@ -26,6 +27,7 @@
   ;; (define IGNORECASE regexp/icase)
   ;; (define M regexp/newline)
   ;; (define MULTILINE regexp/newline)
+  (define EXTENDED 'regexp/extended)
 
   (define (compile pattern . flags)
     "Compile `pattern` into a regular expression object."