Bài tâp lớn môn Cấu trúc rời rạc

TON DUC THANG UNIVERSITY
Faculty of Information Technology

DISCRETE STRUCTURES
Assignment 2
1 Description
Welcome to the second assignment, also the last one, let's complete it before deadline!
After complete the first assignment, you can now parse a Boolean expression to a RPN
expression (also known as postfix notation). However, this is not our main purpose, with the input
is a Boolean expression, the expected output is a truth table. Therefore, in this second assignment,
you have to construct a truth table from the input.
Now, let's define the requirements of your submission program:
-

Your program must read the input from a text file containing Boolean expressions on each
line. (See the attached sample file)

-

After going through your parser, the output is text files containing truth tables, respectively
with the input. (See the attached sample file)

-

Use Scala for programing.

-

The filename of your submission program must be parser.scala.

2 Plagiarism

The assignment must be undertaken individually. Once your work is considered as plagiarism,
you will be prohibited from taking the final exam. Your work will be considered as plagiarism
when:
-

There is an extraordinary similarity between submitted programs. In this case, all submitted
programs will be considered as plagiarism, thus you must protect your work, especially the
source code.

-

You don't understand your own submitted program. It is acceptable to refer other resources,
but you need to clearly understand the meaning of your reference resources.

Phuc Duong – />
1


TON DUC THANG UNIVERSITY
Faculty of Information Technology

3 Important Dates
Important dates are as follows:
-

Progress report #1:

10th October, 2016

-

Progress report #2:

31st October, 2016

-

Final submission:

14th November, 2016

4 Lecturer
Phuc H. Duong –

Phuc Duong – />
2