project cleanups

Author: Araq

.gitignore

@@ -1 +1,2 @@
 nimcache/
+*.exe

README.md

@@ -1,2 +1,7 @@
 # lexim
 Lexer generation and regex implementation for Nim.
+
+# example
+Lexim requires a 'lexe' helper exe that is used by 'lexim'.
+Compile via ``nim c lexe`` and then you can run the example
+via ``nim c ex1.nim``.

LICENSE copying.txtLICENSE renamed to copying.txt

@@ -86,6 +86,9 @@ proc genMatcher(a: DFA; s, i, bodies: NimNode): NimNode {.compileTime.} =
       ifStmt.add newTree(nnkElse, actions)
       caseStmt.add newTree(nnkOfBranch, newLit(src), ifStmt)
 
+template `/.`(x: string): string =
+  (when defined(posix): "./" & x else: x)
+
 macro match*(s: cstring|string; pos: int; sections: untyped): untyped =
   var res: seq[string] = @[]
   for sec in sections.children:
@@ -97,7 +100,7 @@ macro match*(s: cstring|string; pos: int; sections: untyped): untyped =
       error("Expected a node of kind nnkStrLit, got " & $sec[0].kind)
 
   writeFile("lexe.input", $$res)
-  let o = to[DFA](staticExec("lexe"))
+  let o = to[DFA](staticExec(/."lexe"))
   result = genMatcher(o, s, pos, sections)
   #echo repr result
 

ex1.lex

@@ -39,7 +39,6 @@ type
     cc*: ref set[char]
     rule*: int                # if >= 0 it is a final state;
                               # then it is the rule that was matched
-                              # also misused for captures and backrefs!
 
   RegexError* = object of ValueError
   RegexFlag* = enum  ## how regexes are parsed