首页
网站开发
桌面应用
管理软件
微信开发
App开发
嵌入式软件
工具软件
数据采集与分析
其他
首页
>
> 详细
讲解data编程设计、java程序辅导、辅导java编程 解析C/C++编程|讲解数据库SQL
项目预算:
开发周期:
发布时间:
要求地区:
Tokenizer and Parser
Lab
2
Task for this week
▪ Implement Tokenizer
▪ Implement Parser
▪ The code structure/skeleton is available on Wattle
▪ This lab contains assessable items!
▪ Submission Guidelines
▪ The last slide contains information about the submission
▪ Read it carefully to avoid losing marks!
The main objective of this task is to implement a simple tokenizer. The input of the tokenizer is a string. Your
goal is to break down the character stream and return a sequence of tokens.
3
First, take a look at Token.java and
understand the types of tokens we want to
extract from a string. There are 7 types of
tokens:
INT: a decimal 32-bit unsigned integer
(e.g. 4869)
ADD: a single add character “+”
SUB: a single minus character “-”
MUL: a single star character “*”
DIV: a single slash character “/”
LBRA: a single left round bracket “(“
RBRA: a single right round bracket “)”
Task 1 – Tokenizer (0.5 marks)
The main tokenizer class, MyTokenizer.java, inherits abstract class Tokenizer.java which has three
methods:
hasNext() – check if there are still other tokens in the buffer
current() – return the current token
next() – find and extract a new token from buffer and store it in the current token
MyTokenizer.java implements Tokenizer.java and defines two additional private fields: _buffer
and currentToken. _buffer keeps the string that we want to tokenize, and currentToken keeps a Token
instance which is extracted by next() method.
Read the comments in the code to understand the details of how these functions must be implemented.
4
Task 1 – Tokenizer
Check the constructor of MyTokenizer, which will initially save the input string to _buffer and extract the first
token using next(). After, check the implementation of hasNext() and current() in MyTokenizer.
You job is to implement the missing part
of the next() method. Do not change
any other part of the code.
We implemented the (+) and (
-) tokens
for you. The other methods should be
implemented in a similar way (the
integer tokenizer may be a bit different).
White space is also removed for you.
Modify the next() implementation such
that it deals with the tokens “*”, “/”, “(“,
“)” and unsigned integer.
5
Task 1
– Tokenizer
Before implementing the actual method, please go and check the test cases in TokenizerTest.java.
Test cases are one of the best ways to define the requirements of the code (see below one example).
6
Task 1 – Tokenizer
7
Task 1 – Tokenizer
Do not forget to implement your code within the block indicated by the following comments:
‘YOUR CODE STARTS HERE’ and ‘YOUR CODE ENDS HERE’.
How to test your code?
The TokenizerTest.java file has 4 test cases, check each of them.
To assess your code, we will use 5 different test cases, each worth 0.5/5. We will test each method with
empty tokens, and evaluate different expressions.
Again: check the submission guidelines to avoid losing marks (you may get zero marks)!
The main objective of this part is to implement a simple parser. It is simple, but not easy, you need to dedicate
some time to understand the code and start implementing it. Besides that, to complete this task, you first need
to complete Task 1.
After you implement the tokeniser, copy the files Token.java, MyTokenizer.java, and Tokenizer.java
to your Parser project.
Now the goal of this task is to implement a parser for the following grammar:
8
Task 2 – Parser (1.5 marks)
::=
|
+
|
-
::=
|
*
|
/
::=
| (
)
You can try to recreate it using this online parser:
https://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/
Try to understand the grammar and implement the parser.
Go through Exp.java, AddExp.java, IntExp.java, SubExp.java, DivExp.java, MultExp.java files:
Check the implementations of show() and evaluate() methods:
- show() method is designed to return the content of parsed expression
- evaluate() method evaluates and executes the expression and return the result.
Go through ParserTest.java:
ParserTest is a JUnit test class, which defines the proper behaviour of the parser through a set of examples.
Read the code and try to understand what the requirements of the parser are.
Implement the following missing parts of Parser.java:
- parseExp() method
- parseTerm() method
- parseFactor() method
*It can be difficult to start, but I will give you some hints in the next slide! If you do not understand it, ask for help, your tutor
is there to help you understand it.
9
Task 2 – Parser
10
Task 2
– Parser
Note that here I give some tips to start
implementing parseExp().
Try to understand all classes and check
the ParserTest.java. It may help you
understand even more the code.
Ask your tutor if you need help. It is
important that you understand how to
implement a parser!
It is time to code!
11
Task 2 – Parser
Do not forget to implement your code within the block indicated by the following comments:
‘YOUR CODE STARTS HERE’ and ‘YOUR CODE ENDS HERE’.
How to test your code?
The ParserTest.java file has 7 test cases, check each of them.
To assess your code, we will use 13 different test cases, each worth 1.5/13. We will test each method
and evaluate different expressions.
Again: check the submission guidelines to avoid losing marks (you may get zero marks)!
12
Task 2 – Parser
Note that we evaluate the correctness of the code based on the methods: show() and evaluate().
13
Submission Guidelines
▪ Assignment deadline: see the deadline on Wattle (always!)
▪ Submission mode: via Wattle (Lab Tokenizer and Parsing)
Submission format (IMPORTANT):
▪ Upload only your final version of MyTokenizer.java (for task 1) and Parser.java (for task 2) to Wattle
▪ Each test case must run for at most 1000ms, otherwise it will fail (zero marks).
▪ Do not change the file names
▪ Do not upload any other files (only the specified files are needed)
▪ Do not upload a folder (your submission should be only two java files).
▪ The answers will be marked by an automated marker.
▪ Do not change the structure of the source code including class name, package structure, etc.
▪ You are only allowed to edit the designated code segment indicated in the comments.
▪ Do not import packages outside of the standard java SE package. The list of available packages can be found here:
https://docs.oracle.com/en/java/javase/12/docs/api/index.html
▪ Any violation of the submission format will result in zero marks
▪ Reference: see lecture slides / https://web.stanford.edu/class/archive/cs/cs103/cs103.1156/tools/cfg/
软件开发、广告设计客服
QQ:99515681
邮箱:99515681@qq.com
工作时间:8:00-23:00
微信:codinghelp
热点项目
更多
urba6006代写、java/c++编程语...
2024-12-26
代做program、代写python编程语...
2024-12-26
代写dts207tc、sql编程语言代做
2024-12-25
cs209a代做、java程序设计代写
2024-12-25
cs305程序代做、代写python程序...
2024-12-25
代写csc1001、代做python设计程...
2024-12-24
代写practice test preparatio...
2024-12-24
代写bre2031 – environmental...
2024-12-24
代写ece5550: applied kalman ...
2024-12-24
代做conmgnt 7049 – measurem...
2024-12-24
代写ece3700j introduction to...
2024-12-24
代做adad9311 designing the e...
2024-12-24
代做comp5618 - applied cyber...
2024-12-24
热点标签
mktg2509
csci 2600
38170
lng302
csse3010
phas3226
77938
arch1162
engn4536/engn6536
acx5903
comp151101
phl245
cse12
comp9312
stat3016/6016
phas0038
comp2140
6qqmb312
xjco3011
rest0005
ematm0051
5qqmn219
lubs5062m
eee8155
cege0100
eap033
artd1109
mat246
etc3430
ecmm462
mis102
inft6800
ddes9903
comp6521
comp9517
comp3331/9331
comp4337
comp6008
comp9414
bu.231.790.81
man00150m
csb352h
math1041
eengm4100
isys1002
08
6057cem
mktg3504
mthm036
mtrx1701
mth3241
eeee3086
cmp-7038b
cmp-7000a
ints4010
econ2151
infs5710
fins5516
fin3309
fins5510
gsoe9340
math2007
math2036
soee5010
mark3088
infs3605
elec9714
comp2271
ma214
comp2211
infs3604
600426
sit254
acct3091
bbt405
msin0116
com107/com113
mark5826
sit120
comp9021
eco2101
eeen40700
cs253
ece3114
ecmm447
chns3000
math377
itd102
comp9444
comp(2041|9044)
econ0060
econ7230
mgt001371
ecs-323
cs6250
mgdi60012
mdia2012
comm221001
comm5000
ma1008
engl642
econ241
com333
math367
mis201
nbs-7041x
meek16104
econ2003
comm1190
mbas902
comp-1027
dpst1091
comp7315
eppd1033
m06
ee3025
msci231
bb113/bbs1063
fc709
comp3425
comp9417
econ42915
cb9101
math1102e
chme0017
fc307
mkt60104
5522usst
litr1-uc6201.200
ee1102
cosc2803
math39512
omp9727
int2067/int5051
bsb151
mgt253
fc021
babs2202
mis2002s
phya21
18-213
cege0012
mdia1002
math38032
mech5125
07
cisc102
mgx3110
cs240
11175
fin3020s
eco3420
ictten622
comp9727
cpt111
de114102d
mgm320h5s
bafi1019
math21112
efim20036
mn-3503
fins5568
110.807
bcpm000028
info6030
bma0092
bcpm0054
math20212
ce335
cs365
cenv6141
ftec5580
math2010
ec3450
comm1170
ecmt1010
csci-ua.0480-003
econ12-200
ib3960
ectb60h3f
cs247—assignment
tk3163
ics3u
ib3j80
comp20008
comp9334
eppd1063
acct2343
cct109
isys1055/3412
math350-real
math2014
eec180
stat141b
econ2101
msinm014/msing014/msing014b
fit2004
comp643
bu1002
cm2030
联系我们
- QQ: 9951568
© 2021
www.rj363.com
软件定制开发网!