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
3f3dad73
Commit
3f3dad73
authored
Jun 04, 2012
by
Sander Mathijs van Veen
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Remove old, temporary source files.
parent
a0c79c18
Changes
3
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
0 additions
and
278 deletions
+0
-278
src/calc.py
src/calc.py
+0
-238
src/expression.py
src/expression.py
+0
-18
src/unicode_math.py
src/unicode_math.py
+0
-22
No files found.
src/calc.py
deleted
100755 → 0
View file @
a0c79c18
#!/usr/bin/env python
"""
A simple pybison parser program implementing a calculator
"""
from
__future__
import
division
from
sympy
import
Symbol
import
os.path
PYBISON_BUILD
=
os
.
path
.
realpath
(
'build/external/pybison'
)
EXTERNAL_MODS
=
os
.
path
.
realpath
(
'external'
)
import
sys
sys
.
path
.
insert
(
0
,
PYBISON_BUILD
)
sys
.
path
.
insert
(
1
,
EXTERNAL_MODS
)
from
pybison
import
BisonParser
class
Parser
(
BisonParser
):
"""
Implements the calculator parser. Grammar rules are defined in the method
docstrings. Scanner rules are in the 'lexscript' attribute.
"""
# Output directory of generated pybison files, including a trailing slash.
buildDirectory
=
PYBISON_BUILD
+
'/'
# ----------------------------------------------------------------
# lexer tokens - these must match those in your lex script (below)
# ----------------------------------------------------------------
tokens
=
[
'NUMBER'
,
'IDENTIFIER'
,
'PLUS'
,
'MINUS'
,
'TIMES'
,
'DIVIDE'
,
'POW'
,
'LPAREN'
,
'RPAREN'
,
'NEWLINE'
,
'QUIT'
]
# ------------------------------
# precedences
# ------------------------------
precedences
=
(
(
'left'
,
(
'MINUS'
,
'PLUS'
)),
(
'left'
,
(
'TIMES'
,
'DIVIDE'
)),
(
'left'
,
(
'NEG'
,
)),
(
'right'
,
(
'POW'
,
)),
)
interactive
=
0
def
__init__
(
self
,
**
kwargs
):
BisonParser
.
__init__
(
self
,
**
kwargs
)
self
.
interactive
=
kwargs
.
get
(
'interactive'
,
0
)
self
.
timeout
=
kwargs
.
get
(
'timeout'
,
0
)
# ------------------------------------------------------------------
# override default read method with a version that prompts for input
# ------------------------------------------------------------------
def
read
(
self
,
nbytes
):
try
:
return
raw_input
(
'>>> '
)
+
"
\
n
"
except
EOFError
:
return
''
# ---------------------------------------------------------------
# These methods are the python handlers for the bison targets.
# (which get called by the bison code each time the corresponding
# parse target is unambiguously reached)
#
# WARNING - don't touch the method docstrings unless you know what
# you are doing - they are in bison rule syntax, and are passed
# verbatim to bison to build the parser engine library.
# ---------------------------------------------------------------
# Declare the start target here (by name)
start
=
"input"
def
on_input
(
self
,
target
,
option
,
names
,
values
):
"""
input :
| input line
"""
if
option
==
1
:
# Interactive mode is enabled if the term rewriting system is used
# as a shell. In that case, it is useful that the shell prints the
# output of the evaluation.
if
self
.
interactive
:
print
values
[
1
]
return
values
[
1
]
def
on_line
(
self
,
target
,
option
,
names
,
values
):
"""
line : NEWLINE
| exp NEWLINE
"""
if
option
in
[
1
,
2
]:
if
self
.
verbose
:
print
'on_line: exp ='
,
values
[
0
]
return
values
[
0
]
def
on_exp
(
self
,
target
,
option
,
names
,
values
):
"""
exp : NUMBER
| IDENTIFIER
| exp PLUS exp
| exp MINUS exp
| exp TIMES exp
| exp DIVIDE exp
| MINUS exp %prec NEG
| exp POW exp
| LPAREN exp RPAREN
| symbolic
"""
if
self
.
verbose
:
print
'on_exp: got %s %s %s %s'
%
(
target
,
option
,
names
,
values
)
# rule: NUMBER
if
option
==
0
:
# TODO: A bit hacky, this achieves long integers and floats.
#return float(values[0]) if '.' in values[0] else long(values[0])
#return float(values[0])
return
float
(
values
[
0
])
if
'.'
in
values
[
0
]
else
int
(
values
[
0
])
# rule: IDENTIFIER
if
option
==
1
:
return
Symbol
(
values
[
0
])
# rule: LPAREN exp RPAREN
if
option
==
8
:
return
values
[
1
]
# rule: symbolic
if
option
==
9
:
return
values
[
1
]
try
:
# rule: exp PLUS expo
if
option
==
2
:
return
values
[
0
]
+
values
[
2
]
# rule: exp MINUS expo
if
option
==
3
:
return
values
[
0
]
-
values
[
2
]
# rule: exp TIMES expo
if
option
==
4
:
return
values
[
0
]
*
values
[
2
]
# rule: exp DIVIDE expo
if
option
==
5
:
return
values
[
0
]
/
values
[
2
]
# rule: NEG expo
if
option
==
6
:
return
-
values
[
1
]
# rule: exp POW expo
if
option
==
7
:
return
values
[
0
]
**
values
[
2
]
except
OverflowError
:
print
>>
sys
.
stderr
,
'error: Overflow occured in "%s" %s %s %s'
\
%
(
target
,
option
,
names
,
values
)
def
on_symbolic
(
self
,
target
,
option
,
names
,
values
):
"""
symbolic : NUMBER IDENTIFIER
| IDENTIFIER NUMBER
| IDENTIFIER IDENTIFIER
"""
# TODO: this class method requires verification.
# rule: NUMBER IDENTIFIER
if
option
==
0
:
# 4x -> 4*x
return
values
[
0
]
*
Symbol
(
values
[
1
])
# rule: IDENTIFIER NUMBER
if
option
==
1
:
# x4 -> x^4
return
Symbol
(
values
[
0
])
**
values
[
1
]
# rule: IDENTIFIER IDENTIFIER
if
option
==
2
:
# a b -> a * b
return
Symbol
(
values
[
0
])
*
Symbol
(
values
[
1
])
# -----------------------------------------
# raw lex script, verbatim here
# -----------------------------------------
lexscript
=
r"""
%{
//int yylineno = 0;
#include <stdio.h>
#include <string.h>
#include "Python.h"
#define YYSTYPE void *
#include "tokens.h"
extern void *py_parser;
extern void (*py_input)(PyObject *parser, char *buf, int *result,
int max_size);
#define returntoken(tok) \
yylval = PyString_FromString(strdup(yytext)); return (tok);
#define YY_INPUT(buf,result,max_size) { \
(*py_input)(py_parser, buf, &result, max_size); \
}
%}
%%
[0-9]+ { returntoken(NUMBER); }
[a-zA-Z][a-zA-Z0-9]* { returntoken(IDENTIFIER); }
"(" { returntoken(LPAREN); }
")" { returntoken(RPAREN); }
"+" { returntoken(PLUS); }
"-" { returntoken(MINUS); }
"*" { returntoken(TIMES); }
"^" { returntoken(POW); }
"/" { returntoken(DIVIDE); }
"quit" { printf("lex: got QUIT\n"); yyterminate(); returntoken(QUIT); }
[ \t\v\f] {}
[\n] {yylineno++; returntoken(NEWLINE); }
. { printf("unknown char %c ignored, yytext=0x%lx\n",
yytext[0], yytext); /* ignore bad chars */}
%%
yywrap() { return(1); }
"""
if
__name__
==
'__main__'
:
p
=
Parser
(
verbose
=
0
,
keepfiles
=
1
,
interactive
=
1
)
p
.
run
(
debug
=
0
)
# Clear the line, when the shell exits.
print
src/expression.py
deleted
100644 → 0
View file @
a0c79c18
#class Expression(object):
# """Class used to hold a mathematical expression."""
#
# magic_operator_map = {
# int.__add__: '%s + %s',
# int.__sub__: '%s - %s',
# int.__mul__: '%s * %s',
# int.__div__: '%s / %s',
# int.__neg__: '-%s',
# int.__pow__: '%s**%s',
# }
#
# def __init__(self, operator, *args):
# super(Expression, self).__init__()
# self.operator, self.args = args[0], args[1:]
#
# def __str__(self):
# return self.magic_operator_map[self.operator] % self.args
src/unicode_math.py
deleted
100644 → 0
View file @
a0c79c18
# vim: set fileencoding=utf-8 :
SQRT
=
'√'
CBRT
=
'∛'
FORT
=
'∜'
PI
=
'π'
INFINITY
=
'∞'
SUP
=
{
'0'
:
'⁰'
,
'1'
:
'¹'
,
'2'
:
'²'
,
'3'
:
'³'
,
'3'
:
'⁴'
,
'5'
:
'⁵'
,
'6'
:
'⁶'
,
'7'
:
'⁷'
,
'8'
:
'⁸'
,
'9'
:
'⁹'
,
}
DOT
=
'⋅'
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