Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
T
trs
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Taddeüs Kroes
trs
Commits
330a223a
Commit
330a223a
authored
Mar 12, 2012
by
Taddeus Kroes
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Added fix(/hack) that enables use of 'd' as a variable next to being iuses in 'd/dx'.
parent
2b325ca8
Changes
2
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
55 additions
and
45 deletions
+55
-45
src/parser.py
src/parser.py
+54
-44
tests/test_parser.py
tests/test_parser.py
+1
-1
No files found.
src/parser.py
View file @
330a223a
...
@@ -59,7 +59,7 @@ class Parser(BisonParser):
...
@@ -59,7 +59,7 @@ class Parser(BisonParser):
# of tokens of the lex script.
# of tokens of the lex script.
tokens
=
[
'NUMBER'
,
'IDENTIFIER'
,
'NEWLINE'
,
'QUIT'
,
'RAISE'
,
'GRAPH'
,
tokens
=
[
'NUMBER'
,
'IDENTIFIER'
,
'NEWLINE'
,
'QUIT'
,
'RAISE'
,
'GRAPH'
,
'LPAREN'
,
'RPAREN'
,
'FUNCTION'
,
'LBRACKET'
,
'RBRACKET'
,
\
'LPAREN'
,
'RPAREN'
,
'FUNCTION'
,
'LBRACKET'
,
'RBRACKET'
,
\
'APOSTROPH'
,
'DE
LTA
'
]
\
'APOSTROPH'
,
'DE
RIVATIVE
'
]
\
+
filter
(
lambda
t
:
t
!=
'FUNCTION'
,
TOKEN_MAP
.
values
())
+
filter
(
lambda
t
:
t
!=
'FUNCTION'
,
TOKEN_MAP
.
values
())
# ------------------------------
# ------------------------------
...
@@ -154,11 +154,11 @@ class Parser(BisonParser):
...
@@ -154,11 +154,11 @@ class Parser(BisonParser):
# - "a4" with "a^4".
# - "a4" with "a^4".
pattern
=
(
'(?:(
\
))
\
s*(
\
()
'
# match: )( result: ) * (
pattern
=
(
'(?:(
\
))
\
s*(
\
()
'
# match: )( result: ) * (
+ '
|
([
a
-
ce
-
z0
-
9
])
\
s
*
(
\
()
' # match: a(
result: a * (
+ '
|
([
a
-
z0
-
9
])
\
s
*
(
\
()
' # match: a(
result: a * (
+ '
|
(
\
))
\
s
*
([
a
-
ce
-
z0
-
9
])
' # match: )a
result: ) * a
+ '
|
(
\
))
\
s
*
([
a
-
z0
-
9
])
' # match: )a
result: ) * a
+ '
|
([
a
-
ce
-
z
])
\
s
*
([
a
-
ce
-
z
]
+
)
' # match: ab
result: a * b
+ '
|
([
a
-
z
])
\
s
*
([
a
-
z
]
+
)
' # match: ab
result: a * b
+ '
|
([
0
-
9
])
\
s
*
([
a
-
ce
-
z
])
' # match: 4a
result: 4 * a
+ '
|
([
0
-
9
])
\
s
*
([
a
-
z
])
' # match: 4a
result: 4 * a
+ '
|
([
a
-
ce
-
z
])
\
s
*
([
0
-
9
])
' # match: a4
result: a ^ 4
+ '
|
([
a
-
z
])
\
s
*
([
0
-
9
])
' # match: a4
result: a ^ 4
+ '
|
([
0
-
9
])
\
s
+
([
0
-
9
]))
') # match: 4 4 result: 4 * 4
+ '
|
([
0
-
9
])
\
s
+
([
0
-
9
]))
') # match: 4 4 result: 4 * 4
def preprocess_data(match):
def preprocess_data(match):
...
@@ -183,7 +183,10 @@ class Parser(BisonParser):
...
@@ -183,7 +183,10 @@ class Parser(BisonParser):
# Iteratively replace all matches.
# Iteratively replace all matches.
while
True
:
while
True
:
data_after
=
re
.
sub
(
pattern
,
preprocess_data
,
data
)
# match: d/dx result: der_x
data_after
=
re
.
sub
(
r'd\
s*/
\s*d([a-z])'
,
r'der_\1'
,
data
)
data_after
=
re
.
sub
(
pattern
,
preprocess_data
,
data_after
)
if
data
==
data_after
:
if
data
==
data_after
:
break
break
...
@@ -333,8 +336,6 @@ class Parser(BisonParser):
...
@@ -333,8 +336,6 @@ class Parser(BisonParser):
| unary
| unary
| binary
| binary
| nary
| nary
| bracket_derivative
| delta_derivative
"""
"""
# | concat
# | concat
...
@@ -349,51 +350,35 @@ class Parser(BisonParser):
...
@@ -349,51 +350,35 @@ class Parser(BisonParser):
if
option
==
2
:
# rule: LPAREN exp RPAREN
if
option
==
2
:
# rule: LPAREN exp RPAREN
return
values
[
1
]
return
values
[
1
]
if
3
<=
option
<=
7
:
# rule: unary | binary | nary
if
3
<=
option
<=
5
:
# rule: unary | binary | nary
# | bracket_derivative | delta_derivative
return
values
[
0
]
return
values
[
0
]
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
%
(
option
,
target
))
# pragma: nocover
%
(
option
,
target
))
# pragma: nocover
def
on_bracket_derivative
(
self
,
target
,
option
,
names
,
values
):
#def on_delta_derivative(self, target, option, names, values):
"""
# """
bracket_derivative : LBRACKET exp RBRACKET APOSTROPH
# delta_derivative : DELTA DIVIDE DELTA IDENTIFIER TIMES exp
| bracket_derivative APOSTROPH
# | DELTA LPAREN exp RPAREN DIVIDE DELTA IDENTIFIER
"""
# """
op
=
[
k
for
k
,
v
in
OP_MAP
.
iteritems
()
if
v
==
OP_DERIV
][
0
]
if
option
==
0
:
# rule: LBRACKET exp RBRACKET APOSTROPH
return
Node
(
op
,
values
[
1
])
if
option
==
1
:
# rule: bracket_derivative APOSTROPH
return
Node
(
op
,
values
[
0
])
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
%
(
option
,
target
))
# pragma: nocover
def
on_delta_derivative
(
self
,
target
,
option
,
names
,
values
):
"""
delta_derivative : DELTA DIVIDE DELTA IDENTIFIER TIMES exp
| DELTA LPAREN exp RPAREN DIVIDE DELTA IDENTIFIER
"""
op
=
[
k
for
k
,
v
in
OP_MAP
.
iteritems
()
if
v
==
OP_DERIV
][
0
]
#
op = [k for k, v in OP_MAP.iteritems() if v == OP_DERIV][0]
if
option
==
0
:
# rule: DELTA DIVIDE DELTA IDENTIFIER TIMES exp
#
if option == 0: # rule: DELTA DIVIDE DELTA IDENTIFIER TIMES exp
return
Node
(
op
,
values
[
5
],
Leaf
(
values
[
3
]))
#
return Node(op, values[5], Leaf(values[3]))
if
option
==
1
:
# rule: DELTA LPAREN exp RPAREN DIVIDE DELTA IDENTIFIER
#
if option == 1: # rule: DELTA LPAREN exp RPAREN DIVIDE DELTA IDENTIFIER
return
Node
(
op
,
values
[
2
],
Leaf
(
values
[
6
]))
#
return Node(op, values[2], Leaf(values[6]))
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
#
raise BisonSyntaxError('Unsupported option %d in target "%s".'
%
(
option
,
target
))
# pragma: nocover
#
% (option, target)) # pragma: nocover
def
on_unary
(
self
,
target
,
option
,
names
,
values
):
def
on_unary
(
self
,
target
,
option
,
names
,
values
):
"""
"""
unary : MINUS exp %prec NEG
unary : MINUS exp %prec NEG
| FUNCTION exp
| FUNCTION exp
| DERIVATIVE TIMES exp
| bracket_derivative
"""
"""
if
option
==
0
:
# rule: NEG exp
if
option
==
0
:
# rule: NEG exp
...
@@ -413,6 +398,31 @@ class Parser(BisonParser):
...
@@ -413,6 +398,31 @@ class Parser(BisonParser):
return
Node
(
*
values
)
return
Node
(
*
values
)
if
option
==
2
:
# rule: DERIVATIVE exp
op
=
[
k
for
k
,
v
in
OP_MAP
.
iteritems
()
if
v
==
OP_DERIV
][
0
]
return
Node
(
op
,
values
[
2
],
Leaf
(
values
[
0
][
-
1
]))
if
option
==
3
:
# rule: bracket_derivative
return
values
[
0
]
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
%
(
option
,
target
))
# pragma: nocover
def
on_bracket_derivative
(
self
,
target
,
option
,
names
,
values
):
"""
bracket_derivative : LBRACKET exp RBRACKET APOSTROPH
| bracket_derivative APOSTROPH
"""
op
=
[
k
for
k
,
v
in
OP_MAP
.
iteritems
()
if
v
==
OP_DERIV
][
0
]
if
option
==
0
:
# rule: LBRACKET exp RBRACKET APOSTROPH
return
Node
(
op
,
values
[
1
])
if
option
==
1
:
# rule: bracket_derivative APOSTROPH
return
Node
(
op
,
values
[
0
])
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
raise
BisonSyntaxError
(
'Unsupported option %d in target "%s".'
%
(
option
,
target
))
# pragma: nocover
%
(
option
,
target
))
# pragma: nocover
...
@@ -511,9 +521,9 @@ class Parser(BisonParser):
...
@@ -511,9 +521,9 @@ class Parser(BisonParser):
%%
%%
"d
" { returntoken(DELTA
); }
"d
er_"[a-z] { returntoken(DERIVATIVE
); }
[0-9]+"."?[0-9]* { returntoken(NUMBER); }
[0-9]+"."?[0-9]* { returntoken(NUMBER); }
[a-
ce-
zA-Z] { returntoken(IDENTIFIER); }
[a-zA-Z] { returntoken(IDENTIFIER); }
"(" { returntoken(LPAREN); }
"(" { returntoken(LPAREN); }
")" { returntoken(RPAREN); }
")" { returntoken(RPAREN); }
"""
+
operators
+
r"""
"""
+
operators
+
r"""
...
...
tests/test_parser.py
View file @
330a223a
...
@@ -69,4 +69,4 @@ class TestParser(unittest.TestCase):
...
@@ -69,4 +69,4 @@ class TestParser(unittest.TestCase):
exp
,
x
=
tree
(
'x ^ 2, x'
)
exp
,
x
=
tree
(
'x ^ 2, x'
)
self
.
assertEqual
(
tree
(
'd/dx x ^ 2'
),
der
(
exp
,
x
))
self
.
assertEqual
(
tree
(
'd/dx x ^ 2'
),
der
(
exp
,
x
))
self
.
assertEqual
(
tree
(
'd(x ^ 2)/dx'
),
der
(
exp
,
x
))
#
self.assertEqual(tree('d(x ^ 2)/dx'), der(exp, x))
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment