-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy pathregex.py
41 lines (30 loc) · 946 Bytes
/
regex.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
# regex engine in Python
# main program
# 06-JUL-2013
# Supporting: alteration(|), concatenation, repetitions (* ? +), parentheses
#
# TODO:
# more rigorous bnf grammar for regex DONE
# add .
# better unit tests DONE
# backreferences? NO
# convert to DFA
# draw NFA in debug mode using Graphviz
# return positions of match
from parse import Lexer, Parser, Token, State, NFA, Handler
def compile(p, debug = False):
def print_tokens(tokens):
for t in tokens:
print(t)
lexer = Lexer(p)
parser = Parser(lexer)
tokens = parser.parse()
handler = Handler()
if debug:
print_tokens(tokens)
nfa_stack = []
for t in tokens:
handler.handlers[t.name](t, nfa_stack)
assert len(nfa_stack) == 1
return nfa_stack.pop()