add project files
This commit is contained in:
commit
283c7cf178
16 changed files with 1268 additions and 0 deletions
1
README.md
Normal file
1
README.md
Normal file
|
|
@ -0,0 +1 @@
|
||||||
|
#COMP10002 Assignment 1
|
||||||
160
info/COMP10002 Assignment 1 Feedback.txt
Normal file
160
info/COMP10002 Assignment 1 Feedback.txt
Normal file
|
|
@ -0,0 +1,160 @@
|
||||||
|
|
||||||
|
COMP10002 Assignment 1 Feedback: healyr
|
||||||
|
|
||||||
|
Program Presentation
|
||||||
|
Including: layout and style, readability, adherence to coding expectations, general care and appearance.
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
|
||||||
|
Up to Stage 1 initial allocation, +0.5.
|
||||||
|
Up to Stage 2 initial allocation, +1.5.
|
||||||
|
Up to Stage 3 initial allocation, +2.5.
|
||||||
|
Up to Stage 4 initial allocation, +2.5.
|
||||||
|
Up to Stage 5 initial allocation, +2.5.
|
||||||
|
|
||||||
|
Deductions
|
||||||
|
|
||||||
|
Some subset of the following lines will be retained by the marker. Deduct 0.5 marks for every type of errors found. Marks in each section won't go below zero.
|
||||||
|
|
||||||
|
Additions (included in total mark only if marks lost within this first section)
|
||||||
|
|
||||||
|
comment that says "algorithms are fun", +0.5;
|
||||||
|
|
||||||
|
Other Comments from Marker
|
||||||
|
|
||||||
|
Structure and Approach
|
||||||
|
Including: decomposition in to functions, development of data structures and declaration of them at the appropriate locations, choice of parameters to functions, use of appropriate struct and typedef declarations, choice of algorithms or methods.
|
||||||
|
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
|
||||||
|
Up to Stage 1 initial allocation, +0.5.
|
||||||
|
Up to Stage 2 initial allocation, +1.5.
|
||||||
|
Up to Stage 3 initial allocation, +2.5.
|
||||||
|
Up to Stage 4 initial allocation, +2.5.
|
||||||
|
Up to Stage 5 initial allocation, +2.5.
|
||||||
|
|
||||||
|
Deductions
|
||||||
|
Some subset of the following lines will be retained by the marker. Deduct 0.5 marks for every type of errors found. Marks in each section won't go below zero.
|
||||||
|
|
||||||
|
Other comments from marker:
|
||||||
|
|
||||||
|
Program Execution
|
||||||
|
Including: compilation, execution on test data, output presentation and readability.
|
||||||
|
Programs that do not compile in the test environment will lose all marks in this section. Be sure to verify your submission and check the output before you say "finished" to yourself.
|
||||||
|
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
|
||||||
|
Up to Stage 1 initial allocation, +2.
|
||||||
|
Up to Stage 2 initial allocation, +4.
|
||||||
|
Up to Stage 3 initial allocation, +6.
|
||||||
|
Up to Stage 4 initial allocation, +8.
|
||||||
|
Up to Stage 5 initial allocation, +10.
|
||||||
|
|
||||||
|
Deductions
|
||||||
|
|
||||||
|
Some subset of the following lines will be retained by the marker. Marks in each section won't go below zero.
|
||||||
|
|
||||||
|
deduct all execution marks if program generates no output at all; otherwise, deduct marks for the following items:
|
||||||
|
incorrect Stage 5 output on invis1, -1;
|
||||||
|
|
||||||
|
Late Penalty
|
||||||
|
If you make a late submission without having prior agreement from the lecturer, late penalties may apply. Submissions late for more than three days won't be accepted. Overall marks won't go below zero.
|
||||||
|
|
||||||
|
14.0
|
||||||
|
Overall comments from marker:
|
||||||
|
|
||||||
|
Nice! I can tell that you've put a lot of effort into your code formatting, structuring and comments, which I appreciate. It seems that you did have a small bug in your stage 5 however. Regardless, really well done assignment here. Make sure to continue the good work into assignment 2!
|
||||||
|
|
||||||
|
Assignment Marker: Alec Yu
|
||||||
|
Subject Coordinator: Jianzhong Qi, jianzhong.qi@unimelb.edu.au
|
||||||
|
|
||||||
|
==========Auto-Test Output (open on a computer or save it as a txt file)==========
|
||||||
|
|
||||||
|
Compiling with gcc -Wall -std=c99 ...
|
||||||
|
Compilation succeeded.
|
||||||
|
|
||||||
|
============================================
|
||||||
|
Test for input file: invis0.in
|
||||||
|
:)
|
||||||
|
###
|
||||||
|
:),happy
|
||||||
|
|
||||||
|
Expected results: Your results:
|
||||||
|
Stage 1 Stage 1
|
||||||
|
========== ==========
|
||||||
|
Number of tokens: 1 Number of tokens: 1
|
||||||
|
|
||||||
|
Stage 2 Stage 2
|
||||||
|
========== ==========
|
||||||
|
:) :)
|
||||||
|
|
||||||
|
Stage 3 Stage 3
|
||||||
|
========== ==========
|
||||||
|
:) :)
|
||||||
|
|
||||||
|
Stage 4 Stage 4
|
||||||
|
========== ==========
|
||||||
|
Emoticon total: 1 Emoticon total: 1
|
||||||
|
Longest: :) Longest: :)
|
||||||
|
Length: 2 Length: 2
|
||||||
|
|
||||||
|
Stage 5 Stage 5
|
||||||
|
========== ==========
|
||||||
|
:) :)
|
||||||
|
|
||||||
|
Your results seem to be CORRECT. :)
|
||||||
|
|
||||||
|
============================================
|
||||||
|
Test for input file: invis1.in
|
||||||
|
:))),I,told,you,:#,:),:#
|
||||||
|
That,was,**_**:-*,**_**:-*,=)),:))
|
||||||
|
I,have,:)):(,clue,:/,:?,on,this,>:<:):))
|
||||||
|
^-^,You,are,the,best,*-*,:-*
|
||||||
|
See,you,|->,bye
|
||||||
|
Thank,you,:)
|
||||||
|
###
|
||||||
|
:|:),emotion-less
|
||||||
|
:)):(,happy
|
||||||
|
:,sad
|
||||||
|
:?:-*,confused
|
||||||
|
>:<:):)),love
|
||||||
|
^-^:?:/,happy
|
||||||
|
=)):(:((,fun
|
||||||
|
**_**:-*,love
|
||||||
|
|
||||||
|
Expected results: Your results:
|
||||||
|
Stage 1 Stage 1
|
||||||
|
========== ==========
|
||||||
|
Number of tokens: 7 Number of tokens: 7
|
||||||
|
|
||||||
|
Stage 2 Stage 2
|
||||||
|
========== ==========
|
||||||
|
:))),,,,:#,:),:# :))),,,,:#,:),:#
|
||||||
|
,,**_**:-*,**_**:-*,=)),:)) ,,**_**:-*,**_**:-*,=)),:))
|
||||||
|
,,:)):(,,:/,:?,,,>:<:):)) ,,:)):(,,:/,:?,,,>:<:):))
|
||||||
|
^-^,,,,,*-*,:-* ^-^,,,,,*-*,:-*
|
||||||
|
,,|->, ,,|->,
|
||||||
|
,,:) ,,:)
|
||||||
|
|
||||||
|
Stage 3 Stage 3
|
||||||
|
========== ==========
|
||||||
|
:))),:#,:),:# :))),:#,:),:#
|
||||||
|
**_**:-*,**_**:-*,=)),:)) **_**:-*,**_**:-*,=)),:))
|
||||||
|
:)):(,:/,:?,>:<:):)) :)):(,:/,:?,>:<:):))
|
||||||
|
^-^,*-*,:-* ^-^,*-*,:-*
|
||||||
|
|-> |->
|
||||||
|
:) :)
|
||||||
|
|
||||||
|
Stage 4 Stage 4
|
||||||
|
========== ==========
|
||||||
|
Emoticon total: 8 Emoticon total: 8
|
||||||
|
Longest: >:<:):)) Longest: >:<:):))
|
||||||
|
Length: 8 Length: 8
|
||||||
|
|
||||||
|
Stage 5 Stage 5
|
||||||
|
========== ==========
|
||||||
|
,,, | ,:#,:,:
|
||||||
|
**_**:-*,**_**:-*,, | **_**:-*,**_**:-*,,:))
|
||||||
|
:)):(,,,>:<:):)) | :)):(,,:?,>:<:):))
|
||||||
|
,, | ,*-*,
|
||||||
|
|
||||||
|
Oops, your results seem to be INCORRECT. :(
|
||||||
BIN
info/COMP10002 Assignment 1 Information.pdf
Normal file
BIN
info/COMP10002 Assignment 1 Information.pdf
Normal file
Binary file not shown.
179
info/COMP10002 Assignment 1 Marking Scheme.html
Normal file
179
info/COMP10002 Assignment 1 Marking Scheme.html
Normal file
|
|
@ -0,0 +1,179 @@
|
||||||
|
<html>
|
||||||
|
<head>
|
||||||
|
<title>COMP10002 Foundations of Algorithms</title>
|
||||||
|
</head>
|
||||||
|
<body>
|
||||||
|
<font size="+2">
|
||||||
|
<h3>COMP10002 Assignment 1 Feedback: XXUSERNAMEXX</h3>
|
||||||
|
|
||||||
|
<p>
|
||||||
|
<h4>Program Presentation</h4>
|
||||||
|
|
||||||
|
Including: layout and style, readability, adherence to coding
|
||||||
|
expectations, general care and appearance.
|
||||||
|
<br>
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>Up to Stage 1 initial allocation, +0.5.
|
||||||
|
<li>Up to Stage 2 initial allocation, +1.5.
|
||||||
|
<li>Up to Stage 3 initial allocation, +2.5.
|
||||||
|
<li>Up to Stage 4 initial allocation, +2.5.
|
||||||
|
<li>Up to Stage 5 initial allocation, +2.5.
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Deductions</i>
|
||||||
|
<p>
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
<b>Deduct 0.5 marks for every type of errors found.</b>
|
||||||
|
Marks in each section won't go below zero.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>#defines not in upper case;
|
||||||
|
<li>absence of function prototypes;
|
||||||
|
<li>bad choice for function names;
|
||||||
|
<li>bad choices for variable names;
|
||||||
|
<li>excessive commenting;
|
||||||
|
<li>inconsistent bracket placement;
|
||||||
|
<li>inconsistent indentation;
|
||||||
|
<li>insufficient commenting (at least one comment per function to explain what the function does);
|
||||||
|
<li>lack of whitespace (blank line between functions or code blocks);
|
||||||
|
<li>lines >80 chars;
|
||||||
|
<li>no authorship statement (student name and id at the top of program);
|
||||||
|
<li>use of external code without attribution, -0.5 for each occurrence;
|
||||||
|
<li>use of magic numbers;
|
||||||
|
<li>other stylistic issue (minor);
|
||||||
|
<li>other stylistic issue (major), -0.5 for each occurrence;
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Additions (included in total mark only
|
||||||
|
if marks lost within this first section)</i>
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>comment that says "algorithms are fun", +0.5;
|
||||||
|
<li>overall care and presentation, +0.5;
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Other Comments from Marker</i><p>
|
||||||
|
|
||||||
|
<!-- Replace this line if you wish to add comments -->
|
||||||
|
|
||||||
|
|
||||||
|
<h4>Structure and Approach</h4>
|
||||||
|
|
||||||
|
Including: decomposition in to functions, development of data
|
||||||
|
structures and declaration of them at the appropriate locations,
|
||||||
|
choice of parameters to functions, use of appropriate <tt>struct</tt>
|
||||||
|
and
|
||||||
|
<tt>typedef</tt> declarations, choice of algorithms or methods.
|
||||||
|
<p>
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>Up to Stage 1 initial allocation, +0.5.
|
||||||
|
<li>Up to Stage 2 initial allocation, +1.5.
|
||||||
|
<li>Up to Stage 3 initial allocation, +2.5.
|
||||||
|
<li>Up to Stage 4 initial allocation, +2.5.
|
||||||
|
<li>Up to Stage 5 initial allocation, +2.5.
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Deductions</i>
|
||||||
|
<br>
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
<b>Deduct 0.5 marks for every type of errors found.</b>
|
||||||
|
Marks in each section won't go below zero.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>duplicate code segments;
|
||||||
|
<li>global variables;
|
||||||
|
<li>main function modified, -1;
|
||||||
|
<li>insufficient use of functions;
|
||||||
|
<li>functions too long (over 50 lines for any function) or too complex;
|
||||||
|
<li>overly complex algorithmic approach;
|
||||||
|
<li>unnecessary duplication/copying of data;
|
||||||
|
<!-- avoidence of using structs -->
|
||||||
|
<li>typedefs without "_t";
|
||||||
|
<li>overly complex function argument lists;
|
||||||
|
<li>using == for equality on doubles;
|
||||||
|
<li>using any string.h functions in Stage 5, -1;
|
||||||
|
<li>other structural issue (minor);
|
||||||
|
<li>other structural issue (major), -0.5 for each occurrence;
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Other comments from marker</i>:<p>
|
||||||
|
|
||||||
|
<!-- Replace this line if you wish to add comments -->
|
||||||
|
|
||||||
|
<h4>Program Execution</h4>
|
||||||
|
Including: compilation, execution on test data, output presentation
|
||||||
|
and readability.<br>
|
||||||
|
Programs that do not compile in the test environment will lose all
|
||||||
|
marks in this section.
|
||||||
|
Be sure to <tt>verify</tt> your submission and <b>check the output</b>
|
||||||
|
before you say "finished" to yourself.
|
||||||
|
<p>
|
||||||
|
Some subset of the following lines will be retained by the marker.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>Up to Stage 1 initial allocation, +2.
|
||||||
|
<li>Up to Stage 2 initial allocation, +4.
|
||||||
|
<li>Up to Stage 3 initial allocation, +6.
|
||||||
|
<li>Up to Stage 4 initial allocation, +8.
|
||||||
|
<li>Up to Stage 5 initial allocation, +10.
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
|
||||||
|
</ul><p>
|
||||||
|
<i>Deductions</i>
|
||||||
|
<p>Some subset of the following lines will be retained by the marker.
|
||||||
|
Marks in each section won't go below zero.
|
||||||
|
<p><ul>
|
||||||
|
|
||||||
|
<li>deduct all execution marks if program generates no output at all; otherwise,
|
||||||
|
deduct marks for the following items:
|
||||||
|
</br></br>
|
||||||
|
|
||||||
|
<li>incorrect Stage 1 output on invis0, -1 (for all formatting errors in Stage 1, deduct 0.5 marks once across all test cases)
|
||||||
|
<li>incorrect Stage 2 output on invis0, -1 (for all formatting errors in Stage 2, deduct 0.5 marks once across all test cases);
|
||||||
|
<li>incorrect Stage 3 output on invis0, -1 (for all formatting errors in Stage 3, deduct 0.5 marks once across all test cases);
|
||||||
|
<li>incorrect Stage 4 output on invis0, -1 (for all formatting errors in Stage 4, deduct 0.5 marks once across all test cases);
|
||||||
|
<li>incorrect Stage 5 output on invis0, -1 (for all formatting errors in Stage 5, deduct 0.5 marks once across all test cases);</br></br>
|
||||||
|
|
||||||
|
<li>incorrect Stage 1 output on invis1, -1;
|
||||||
|
<li>incorrect Stage 2 output on invis1, -1;
|
||||||
|
<li>incorrect Stage 3 output on invis1, -1;
|
||||||
|
<li>incorrect Stage 4 output on invis1, -1;
|
||||||
|
<li>incorrect Stage 5 output on invis1, -1;
|
||||||
|
|
||||||
|
<!-- BEGIN-CHOICES
|
||||||
|
END-CHOICES -->
|
||||||
|
</ul><p>
|
||||||
|
<p>
|
||||||
|
<h4>Late Penalty</h4>
|
||||||
|
If you make a late submission without having prior agreement from
|
||||||
|
the lecturer, late penalties may apply.
|
||||||
|
Submissions late for more than three days won't be accepted. Overall marks won't go below zero.
|
||||||
|
|
||||||
|
<p>
|
||||||
|
|
||||||
|
<h4>XXMARKXX</h4> <!-- will be replaced automatically -->
|
||||||
|
|
||||||
|
|
||||||
|
<i>Overall comments from marker</i>:<p>
|
||||||
|
|
||||||
|
|
||||||
|
<p>
|
||||||
|
<i>Assignment Marker: XXMARKERXX</i>
|
||||||
|
<br>
|
||||||
|
<i>Subject Coordinator: Jianzhong Qi, jianzhong.qi@unimelb.edu.au</i>
|
||||||
|
</font>
|
||||||
|
</body>
|
||||||
|
</html>
|
||||||
158
info/program.c
Normal file
158
info/program.c
Normal file
|
|
@ -0,0 +1,158 @@
|
||||||
|
/* Emoticon message cleanser:
|
||||||
|
*
|
||||||
|
* Skeleton code written by Farhana Choudhury and Jianzhong Qi, April 2020
|
||||||
|
*
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <ctype.h>
|
||||||
|
|
||||||
|
#define STAGE_NUM_ONE 1 /* stage numbers */
|
||||||
|
#define STAGE_NUM_TWO 2
|
||||||
|
#define STAGE_NUM_THREE 3
|
||||||
|
#define STAGE_NUM_FOUR 4
|
||||||
|
#define STAGE_NUM_FIVE 5
|
||||||
|
#define STAGE_HEADER "Stage %d\n==========\n" /* stage header format string */
|
||||||
|
|
||||||
|
#define MAX_MSG_LENGTH 280 /* maximum message length */
|
||||||
|
#define MAX_NUM_MSGS 100 /* maximum number of messages */
|
||||||
|
#define MAX_EMTCN_LENGTH 50 /* maximum emot. line length */
|
||||||
|
#define MAX_NUM_EMTCN 50 /* maximum number of emot. */
|
||||||
|
|
||||||
|
typedef char msg_t[MAX_MSG_LENGTH+1]; /* a message */
|
||||||
|
typedef char emtcn_t[MAX_EMTCN_LENGTH+1]; /* an emoticon */
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
|
||||||
|
/* function prototypes */
|
||||||
|
void read_one_msg(msg_t one_msg, int max_len);
|
||||||
|
void print_stage_header(int stage_num);
|
||||||
|
int count_tokens(msg_t one_msg);
|
||||||
|
|
||||||
|
void stage_one(msg_t one_msg);
|
||||||
|
void stage_two(msg_t msgs[], int *num_msgs);
|
||||||
|
void stage_three(msg_t msgs[], int num_msgs);
|
||||||
|
void stage_four(emtcn_t emtcns[], int *num_emtcns);
|
||||||
|
void stage_five(msg_t msgs[], int num_msgs, emtcn_t emtcns[], int num_emtcns);
|
||||||
|
|
||||||
|
/* add your own function prototypes here */
|
||||||
|
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
|
||||||
|
/* main function controls all the action, do NOT modify this function */
|
||||||
|
int
|
||||||
|
main(int argc, char *argv[]) {
|
||||||
|
/* to hold all input messages */
|
||||||
|
msg_t msgs[MAX_NUM_MSGS];
|
||||||
|
/* to hold the number of input messages */
|
||||||
|
int num_msgs = 0;
|
||||||
|
/* to hold all input emoticons in the dictionary */
|
||||||
|
emtcn_t emtcns[MAX_NUM_EMTCN];
|
||||||
|
/* to hold the number of emoticons in the dictionary */
|
||||||
|
int num_emtcns = 0;
|
||||||
|
|
||||||
|
/* stage 1: reading the first message */
|
||||||
|
stage_one(msgs[num_msgs]);
|
||||||
|
num_msgs++;
|
||||||
|
|
||||||
|
/* stage 2: removing alphanumeric characters */
|
||||||
|
stage_two(msgs, &num_msgs);
|
||||||
|
|
||||||
|
/* stage 3: removing extra commas */
|
||||||
|
stage_three(msgs, num_msgs);
|
||||||
|
|
||||||
|
/* stage 4: reading the dictionary and finding the longest emoticon */
|
||||||
|
stage_four(emtcns, &num_emtcns);
|
||||||
|
|
||||||
|
/* stage 5: removing invalid emoticons with the help of the dictionary */
|
||||||
|
stage_five(msgs, num_msgs, emtcns, num_emtcns);
|
||||||
|
|
||||||
|
/* all done; take some rest */
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* read a line of input into one_msg */
|
||||||
|
void
|
||||||
|
read_one_msg(msg_t one_msg, int max_len) {
|
||||||
|
int i = 0, c;
|
||||||
|
while (((c = getchar()) != EOF) && (c != '\n') && (c != '\r')) {
|
||||||
|
if (i < max_len) {
|
||||||
|
one_msg[i++] = c;
|
||||||
|
} else {
|
||||||
|
printf("Invalid input line, toooooooo long.\n");
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
one_msg[i] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
/* print stage header given stage number */
|
||||||
|
void
|
||||||
|
print_stage_header(int stage_num) {
|
||||||
|
printf(STAGE_HEADER, stage_num);
|
||||||
|
}
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
/* add your code below */
|
||||||
|
|
||||||
|
/* scan a message and count the number of tokens (separated by commas) in it */
|
||||||
|
int
|
||||||
|
count_tokens(msg_t one_msg) {
|
||||||
|
/* add code here to count the number commas in one_msg,
|
||||||
|
and return the count + 1 */
|
||||||
|
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 1: reading the first message */
|
||||||
|
void
|
||||||
|
stage_one(msg_t one_msg) {
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_ONE);
|
||||||
|
|
||||||
|
/* read the first message */
|
||||||
|
|
||||||
|
/* count and print the number of tokens */
|
||||||
|
printf("Number of tokens: %d\n\n", count_tokens(one_msg));
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 2: removing alphanumeric characters */
|
||||||
|
void
|
||||||
|
stage_two(msg_t msgs[], int *num_msgs) {
|
||||||
|
/* add code for stage 2 */
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_TWO);
|
||||||
|
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 3: removing extra commas */
|
||||||
|
void
|
||||||
|
stage_three(msg_t msgs[], int num_msgs) {
|
||||||
|
/* add code for stage 3 */
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_THREE);
|
||||||
|
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 4: reading the dictionary and finding the longest emoticon */
|
||||||
|
void stage_four(emtcn_t emtcns[], int *num_emtcns) {
|
||||||
|
/* add code for stage 4 */
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_FOUR);
|
||||||
|
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 5: removing invalid emoticons with the help of the dictionary */
|
||||||
|
void
|
||||||
|
stage_five(msg_t msgs[], int num_msgs, emtcn_t emtcns[], int num_emtcns) {
|
||||||
|
/* add code for stage 5 */
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_FIVE);
|
||||||
|
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
32
info/test0-output.txt
Normal file
32
info/test0-output.txt
Normal file
|
|
@ -0,0 +1,32 @@
|
||||||
|
Stage 1
|
||||||
|
==========
|
||||||
|
Number of tokens: 6
|
||||||
|
|
||||||
|
Stage 2
|
||||||
|
==========
|
||||||
|
,,,,=)),:))
|
||||||
|
,,,,:/,:?,,,
|
||||||
|
^-^,,,,,*-*,:-*
|
||||||
|
,,|->,
|
||||||
|
,,:)
|
||||||
|
|
||||||
|
Stage 3
|
||||||
|
==========
|
||||||
|
=)),:))
|
||||||
|
:/,:?
|
||||||
|
^-^,*-*,:-*
|
||||||
|
|->
|
||||||
|
:)
|
||||||
|
|
||||||
|
Stage 4
|
||||||
|
==========
|
||||||
|
Emoticon total: 10
|
||||||
|
Longest: **_**
|
||||||
|
Length: 5
|
||||||
|
|
||||||
|
Stage 5
|
||||||
|
==========
|
||||||
|
=)),:))
|
||||||
|
:/,:?
|
||||||
|
^-^,,:-*
|
||||||
|
:)
|
||||||
16
info/test0.txt
Normal file
16
info/test0.txt
Normal file
|
|
@ -0,0 +1,16 @@
|
||||||
|
That,was,really,funny,=)),:))
|
||||||
|
I,have,no,clue,:/,:?,on,this,matter
|
||||||
|
^-^,You,are,the,best,*-*,:-*
|
||||||
|
See,you,|->,bye
|
||||||
|
Thank,you,:)
|
||||||
|
###
|
||||||
|
:),happy
|
||||||
|
:)),happy
|
||||||
|
^-^,happy
|
||||||
|
:?,confused
|
||||||
|
:/,confused
|
||||||
|
=)),fun
|
||||||
|
:(,sad
|
||||||
|
:((,sad
|
||||||
|
**_**,love
|
||||||
|
:-*,love
|
||||||
31
info/test1-output.txt
Normal file
31
info/test1-output.txt
Normal file
|
|
@ -0,0 +1,31 @@
|
||||||
|
Stage 1
|
||||||
|
==========
|
||||||
|
Number of tokens: 8
|
||||||
|
|
||||||
|
Stage 2
|
||||||
|
==========
|
||||||
|
,,,,:),,,>:<
|
||||||
|
**_**,,,
|
||||||
|
,,,:(,:'(,:(
|
||||||
|
,,:-)
|
||||||
|
:))),,,,:#,:),:#
|
||||||
|
|
||||||
|
Stage 3
|
||||||
|
==========
|
||||||
|
:),>:<
|
||||||
|
**_**
|
||||||
|
:(,:'(,:(
|
||||||
|
:-)
|
||||||
|
:))),:#,:),:#
|
||||||
|
|
||||||
|
Stage 4
|
||||||
|
==========
|
||||||
|
Emoticon total: 8
|
||||||
|
Longest: :))
|
||||||
|
Length: 3
|
||||||
|
|
||||||
|
Stage 5
|
||||||
|
==========
|
||||||
|
:),>:<
|
||||||
|
:(,:'(,:(
|
||||||
|
,,:),
|
||||||
14
info/test1.txt
Normal file
14
info/test1.txt
Normal file
|
|
@ -0,0 +1,14 @@
|
||||||
|
You,only,live,once,:),live,happy,>:<
|
||||||
|
**_**,concert,in,town
|
||||||
|
That,was,unexpected,:(,:'(,:(
|
||||||
|
Thank,you,:-)
|
||||||
|
:))),I,told,you,:#,:),:#
|
||||||
|
###
|
||||||
|
:|,emotion-less
|
||||||
|
:),happy
|
||||||
|
:)),happy
|
||||||
|
:(,sad
|
||||||
|
:'(,sad
|
||||||
|
:?,confused
|
||||||
|
:-*,love
|
||||||
|
>:<,love
|
||||||
BIN
program
Normal file
BIN
program
Normal file
Binary file not shown.
584
program.c
Normal file
584
program.c
Normal file
|
|
@ -0,0 +1,584 @@
|
||||||
|
/* Emoticon message cleanser:
|
||||||
|
*
|
||||||
|
* Skeleton code written by Farhana Choudhury and Jianzhong Qi, April 2020
|
||||||
|
*
|
||||||
|
* Authorship Declaration:
|
||||||
|
* (1) I certify that the program contained in this submission is completely
|
||||||
|
* my own individual work, except where explicitly noted by comments that
|
||||||
|
* provide details otherwise. I understand that work that has been developed
|
||||||
|
* by another student, or by me in collaboration with other students,
|
||||||
|
* or by non-students as a result of request, solicitation, or payment,
|
||||||
|
* may not be submitted for assessment in this subject. I understand that
|
||||||
|
* submitting for assessment work developed by or in collaboration with
|
||||||
|
* other students or non-students constitutes Academic Misconduct, and
|
||||||
|
* may be penalized by mark deductions, or by other penalties determined
|
||||||
|
* via the University of Melbourne Academic Honesty Policy, as described
|
||||||
|
* at https://academicintegrity.unimelb.edu.au.
|
||||||
|
*
|
||||||
|
* (2) I also certify that I have not provided a copy of this work in either
|
||||||
|
* softcopy or hardcopy or any other form to any other student, and nor will
|
||||||
|
* I do so until after the marks are released. I understand that providing
|
||||||
|
* my work to other students, regardless of my intention or any undertakings
|
||||||
|
* made to me by that other student, is also Academic Misconduct.
|
||||||
|
*
|
||||||
|
* (3) I further understand that providing a copy of the assignment
|
||||||
|
* specification to any form of code authoring or assignment tutoring
|
||||||
|
* service, or drawing the attention of others to such services and code
|
||||||
|
* that may have been made available via such a service, may be regarded
|
||||||
|
* as Student General Misconduct (interfering with the teaching activities
|
||||||
|
* of the University and/or inciting others to commit Academic Misconduct).
|
||||||
|
* I understand that an allegation of Student General Misconduct may arise
|
||||||
|
* regardless of whether or not I personally make use of such solutions
|
||||||
|
* or sought benefit from such actions.
|
||||||
|
*
|
||||||
|
* Signed by: Rory Healy 964275
|
||||||
|
* Dated: 9th April 2020
|
||||||
|
*/
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <ctype.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
#define STAGE_NUM_ONE 1 /* stage numbers */
|
||||||
|
#define STAGE_NUM_TWO 2
|
||||||
|
#define STAGE_NUM_THREE 3
|
||||||
|
#define STAGE_NUM_FOUR 4
|
||||||
|
#define STAGE_NUM_FIVE 5
|
||||||
|
#define STAGE_HEADER "Stage %d\n==========\n" /* stage header format string */
|
||||||
|
|
||||||
|
#define MAX_MSG_LENGTH 280 /* maximum message length */
|
||||||
|
#define MAX_NUM_MSGS 100 /* maximum number of messages */
|
||||||
|
#define MAX_EMTCN_LENGTH 50 /* maximum emot. line length */
|
||||||
|
#define MAX_NUM_EMTCN 50 /* maximum number of emot. */
|
||||||
|
|
||||||
|
typedef char msg_t[MAX_MSG_LENGTH+1]; /* a message */
|
||||||
|
typedef char emtcn_t[MAX_EMTCN_LENGTH+1]; /* an emoticon */
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
|
||||||
|
/* function prototypes */
|
||||||
|
void read_one_msg(msg_t one_msg, int max_len);
|
||||||
|
void print_stage_header(int stage_num);
|
||||||
|
int count_tokens(msg_t one_msg);
|
||||||
|
|
||||||
|
void stage_one(msg_t one_msg);
|
||||||
|
void stage_two(msg_t msgs[], int *num_msgs);
|
||||||
|
void stage_three(msg_t msgs[], int num_msgs);
|
||||||
|
void stage_four(emtcn_t emtcns[], int *num_emtcns);
|
||||||
|
void stage_five(msg_t msgs[], int num_msgs, emtcn_t emtcns[], int num_emtcns);
|
||||||
|
|
||||||
|
/* add your own function prototypes here */
|
||||||
|
int is_seperating_line(msg_t one_msg);
|
||||||
|
|
||||||
|
void remove_leading_commas(msg_t one_msg, int msg_len);
|
||||||
|
void remove_trailing_commas(msg_t one_msg, int msg_len);
|
||||||
|
void remove_consecutive_commas(msg_t one_msg, int msg_len);
|
||||||
|
int length_consecutive_commas(msg_t one_msg, int msg_len);
|
||||||
|
|
||||||
|
void get_next_emtcn(msg_t one_msg, emtcn_t emtcn_msg, \
|
||||||
|
int *emtcn_len, int *msg_offset);
|
||||||
|
void remove_curr_emtcn(msg_t one_msg, int emtcn_len, int offset, int *msg_len);
|
||||||
|
int get_emtcn_len(msg_t one_msg, int msg_len, int msg_offset);
|
||||||
|
int is_emtcns_same(emtcn_t emtcn1, emtcn_t emtcn2, int emtcn_len);
|
||||||
|
int is_in_dict(emtcn_t curr_emtcn, int curr_emtcn_len, \
|
||||||
|
emtcn_t emtcns[], int num_emtcns);
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
|
||||||
|
/* main function controls all the action, do NOT modify this function */
|
||||||
|
int
|
||||||
|
main(int argc, char *argv[]) {
|
||||||
|
/* to hold all input messages */
|
||||||
|
msg_t msgs[MAX_NUM_MSGS];
|
||||||
|
/* to hold the number of input messages */
|
||||||
|
int num_msgs = 0;
|
||||||
|
/* to hold all input emoticons in the dictionary */
|
||||||
|
emtcn_t emtcns[MAX_NUM_EMTCN];
|
||||||
|
/* to hold the number of emoticons in the dictionary */
|
||||||
|
int num_emtcns = 0;
|
||||||
|
|
||||||
|
/* stage 1: reading the first message */
|
||||||
|
stage_one(msgs[num_msgs]);
|
||||||
|
num_msgs++;
|
||||||
|
|
||||||
|
/* stage 2: removing alphanumeric characters */
|
||||||
|
stage_two(msgs, &num_msgs);
|
||||||
|
|
||||||
|
/* stage 3: removing extra commas */
|
||||||
|
stage_three(msgs, num_msgs);
|
||||||
|
|
||||||
|
/* stage 4: reading the dictionary and finding the longest emoticon */
|
||||||
|
stage_four(emtcns, &num_emtcns);
|
||||||
|
|
||||||
|
/* stage 5: removing invalid emoticons with the help of the dictionary */
|
||||||
|
stage_five(msgs, num_msgs, emtcns, num_emtcns);
|
||||||
|
|
||||||
|
/* all done; take some rest */
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* read a line of input into one_msg */
|
||||||
|
void
|
||||||
|
read_one_msg(msg_t one_msg, int max_len) {
|
||||||
|
int i = 0, c;
|
||||||
|
while (((c = getchar()) != EOF) && (c != '\n') && (c != '\r')) {
|
||||||
|
if (i < max_len) {
|
||||||
|
one_msg[i++] = c;
|
||||||
|
} else {
|
||||||
|
printf("Invalid input line, toooooooo long.\n");
|
||||||
|
exit(EXIT_FAILURE);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
one_msg[i] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
/* print stage header given stage number */
|
||||||
|
void
|
||||||
|
print_stage_header(int stage_num) {
|
||||||
|
printf(STAGE_HEADER, stage_num);
|
||||||
|
}
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
/* add your code below */
|
||||||
|
|
||||||
|
/* removes an emtcn from a msg given a length and offset */
|
||||||
|
void
|
||||||
|
remove_curr_emtcn(msg_t one_msg, int emtcn_len, int offset, int *msg_len) {
|
||||||
|
msg_t msg_before, msg_after;
|
||||||
|
int i, j;
|
||||||
|
|
||||||
|
/* the message before the emtcn not in dict */
|
||||||
|
for (i = 0; i < offset; i++) {
|
||||||
|
msg_before[i] = one_msg[i];
|
||||||
|
}
|
||||||
|
msg_before[i] = '\0';
|
||||||
|
|
||||||
|
/* the message after the emtcn not in dict */
|
||||||
|
for (j = offset + emtcn_len; one_msg[j] != '\0'; j++) {
|
||||||
|
msg_after[j - offset - emtcn_len] = one_msg[j];
|
||||||
|
}
|
||||||
|
msg_after[j - offset - emtcn_len] = '\0';
|
||||||
|
|
||||||
|
/* replacing one_msg with msg_before and msg_after */
|
||||||
|
one_msg[0] = 0;
|
||||||
|
for (i = 0; i < *msg_len - emtcn_len; i++) {
|
||||||
|
if (i < offset) {
|
||||||
|
one_msg[i] = msg_before[i];
|
||||||
|
} else {
|
||||||
|
one_msg[i] = msg_after[i - offset];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
one_msg[i] = '\0';
|
||||||
|
|
||||||
|
// here is where a bug occurs in test 1
|
||||||
|
*msg_len -= emtcn_len;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* finds the next emoticon in one_msg and copies it to emtcn_msg */
|
||||||
|
void
|
||||||
|
get_next_emtcn(msg_t one_msg, emtcn_t emtcn_msg, \
|
||||||
|
int *emtcn_len, int *msg_offset) {
|
||||||
|
int i;
|
||||||
|
for (i = *msg_offset; one_msg[i] != '\0'; i++) {
|
||||||
|
if (one_msg[i] == ',') {
|
||||||
|
break;
|
||||||
|
} else {
|
||||||
|
emtcn_msg[i - *msg_offset] = one_msg[i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
*emtcn_len = i - *msg_offset;
|
||||||
|
emtcn_msg[*emtcn_len] = '\0';
|
||||||
|
*msg_offset += *emtcn_len + 1; // add 1 to account for the comma
|
||||||
|
}
|
||||||
|
|
||||||
|
/* tests if two emtcns are identical */
|
||||||
|
int
|
||||||
|
is_emtcns_same(emtcn_t emtcn1, emtcn_t emtcn2, int emtcn_len) {
|
||||||
|
for (int i = 0; i < emtcn_len; i++) {
|
||||||
|
if (emtcn1[i] != emtcn2[i]) {
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* tests if an emoticon is in the dictionary emtcns[] */
|
||||||
|
int
|
||||||
|
is_in_dict(emtcn_t curr_emtcn, int curr_emtcn_len, \
|
||||||
|
emtcn_t emtcns[], int num_emtcns) {
|
||||||
|
/* the current emtcn from emtcns[] being compared */
|
||||||
|
emtcn_t emtcn_from_dict;
|
||||||
|
|
||||||
|
int i, j;
|
||||||
|
for (i = 0; i < num_emtcns; i++) {
|
||||||
|
/* extracts the emoticon from the dictionary */
|
||||||
|
for (j = 0; emtcns[i][j] != ','; j++) {
|
||||||
|
emtcn_from_dict[j] = emtcns[i][j];
|
||||||
|
}
|
||||||
|
emtcn_from_dict[j] = '\0';
|
||||||
|
|
||||||
|
/* compares lengths first to avoid unnecessary function calls */
|
||||||
|
if (curr_emtcn_len == j) {
|
||||||
|
if (is_emtcns_same(emtcn_from_dict, curr_emtcn, curr_emtcn_len)) {
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* removes leading commas from a message */
|
||||||
|
void
|
||||||
|
remove_leading_commas(msg_t one_msg, int msg_len) {
|
||||||
|
/* counts the number of leading commas */
|
||||||
|
int i = 0;
|
||||||
|
while (one_msg[i] == ',') {
|
||||||
|
i += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* counts the number of characters copied into new_msg */
|
||||||
|
int j;
|
||||||
|
|
||||||
|
/* the message without leading commas */
|
||||||
|
msg_t new_msg;
|
||||||
|
for (j = 0; j < msg_len; j++) {
|
||||||
|
if (one_msg[j + i] == '\0') {
|
||||||
|
break;
|
||||||
|
} else {
|
||||||
|
new_msg[j] = one_msg[j + i];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
new_msg[j] = '\0';
|
||||||
|
|
||||||
|
/* clears one_msg, and replaces with new_msg */
|
||||||
|
one_msg[0] = 0;
|
||||||
|
strncpy(one_msg, new_msg, j);
|
||||||
|
one_msg[j] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
/* removes trailing commas from a message */
|
||||||
|
void
|
||||||
|
remove_trailing_commas(msg_t one_msg, int msg_len) {
|
||||||
|
/* counts the number of trailing commas */
|
||||||
|
int i = 0;
|
||||||
|
while (one_msg[msg_len - i - 1] == ',') {
|
||||||
|
i += 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* counts the number of characters copied into new_msg */
|
||||||
|
int j;
|
||||||
|
|
||||||
|
/* the message without trailing commas */
|
||||||
|
msg_t new_msg;
|
||||||
|
for (j = 0; j < msg_len - i; j++) {
|
||||||
|
new_msg[j] = one_msg[j];
|
||||||
|
}
|
||||||
|
new_msg[j] = '\0';
|
||||||
|
|
||||||
|
/* clears one_msg, and replaces with new_msg */
|
||||||
|
one_msg[0] = 0;
|
||||||
|
strncpy(one_msg, new_msg, j);
|
||||||
|
one_msg[j] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
/* removes consecutive commas from within a message */
|
||||||
|
void remove_consecutive_commas(msg_t one_msg, int msg_len) {
|
||||||
|
one_msg[msg_len] = '\0'; // safety net
|
||||||
|
|
||||||
|
int max_commas_length = length_consecutive_commas(one_msg, msg_len);
|
||||||
|
|
||||||
|
while (max_commas_length > 1) {
|
||||||
|
int i = 0, j = 0;
|
||||||
|
msg_t new_msg, msg_cat;
|
||||||
|
|
||||||
|
/* find out where the consecutive commas start */
|
||||||
|
for (i = 0; i < msg_len; i++) {
|
||||||
|
if ((one_msg[i] == ',') && (one_msg[i + 1] == ',')) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
/* add all characters including one comma to new_msg */
|
||||||
|
strncpy(new_msg, one_msg, i);
|
||||||
|
new_msg[i] = '\0';
|
||||||
|
|
||||||
|
/* find out how long the rest of the message is */
|
||||||
|
for (j = 0; j < msg_len; j++) {
|
||||||
|
if (one_msg[j + i + max_commas_length - 1] == '\0') {
|
||||||
|
break;
|
||||||
|
} else {
|
||||||
|
msg_cat[j] = one_msg[j + i + max_commas_length - 1];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
msg_cat[j] = '\0';
|
||||||
|
|
||||||
|
/* and add the rest of the message to new_msg (exluding the extra
|
||||||
|
* commas
|
||||||
|
*/
|
||||||
|
|
||||||
|
strncat(new_msg, msg_cat, j);
|
||||||
|
new_msg[i + j] = '\0';
|
||||||
|
|
||||||
|
/* clear one_msg and copy the edited message to it */
|
||||||
|
one_msg[0] = 0;
|
||||||
|
strncpy(one_msg, new_msg, i + j);
|
||||||
|
one_msg[i + j] = '\0';
|
||||||
|
msg_len = i + j;
|
||||||
|
|
||||||
|
/* Loop guard */
|
||||||
|
max_commas_length = length_consecutive_commas(one_msg, msg_len);
|
||||||
|
}
|
||||||
|
|
||||||
|
}
|
||||||
|
|
||||||
|
/* finds the length of the first non-one length of commas */
|
||||||
|
int length_consecutive_commas(msg_t one_msg, int msg_len) {
|
||||||
|
int i, counter = 0;
|
||||||
|
for (i = 0; i < msg_len; i++) {
|
||||||
|
if (one_msg[i] == ',') {
|
||||||
|
if (one_msg[i + 1] == ',') {
|
||||||
|
counter += 1;
|
||||||
|
continue;
|
||||||
|
} else {
|
||||||
|
if (counter) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return counter + 1;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* checks if the current message is a seperating line */
|
||||||
|
int
|
||||||
|
is_seperating_line(msg_t one_msg) {
|
||||||
|
msg_t seperating_line = "###";
|
||||||
|
if (!strncmp(one_msg, seperating_line, strlen(seperating_line))) {
|
||||||
|
return 1;
|
||||||
|
}
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* scan a message and count the number of tokens in it */
|
||||||
|
int
|
||||||
|
count_tokens(msg_t one_msg) {
|
||||||
|
/* this counts the number of commas, which is analogous
|
||||||
|
to the number of tokens */
|
||||||
|
int num_tokens = 1;
|
||||||
|
|
||||||
|
for (int i = 0; i < (int)strlen(one_msg); i++) {
|
||||||
|
if (one_msg[i] == ',') {
|
||||||
|
num_tokens += 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
return num_tokens;
|
||||||
|
}
|
||||||
|
|
||||||
|
/****************************************************************/
|
||||||
|
/* stages 1 - 5 */
|
||||||
|
|
||||||
|
/* stage 1: reading the first message */
|
||||||
|
void
|
||||||
|
stage_one(msg_t one_msg) {
|
||||||
|
/* print stage header */
|
||||||
|
print_stage_header(STAGE_NUM_ONE);
|
||||||
|
|
||||||
|
/* read the first message */
|
||||||
|
read_one_msg(one_msg, MAX_MSG_LENGTH);
|
||||||
|
|
||||||
|
/* count and print the number of tokens */
|
||||||
|
printf("Number of tokens: %d\n\n", count_tokens(one_msg));
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 2: removing alphanumeric characters */
|
||||||
|
void
|
||||||
|
stage_two(msg_t msgs[], int *num_msgs) {
|
||||||
|
print_stage_header(STAGE_NUM_TWO);
|
||||||
|
|
||||||
|
/* *num_msgs will be used as an index, hence why it is zeroed */
|
||||||
|
*num_msgs = 0;
|
||||||
|
|
||||||
|
/* the current message being analysed */
|
||||||
|
msg_t curr_msg;
|
||||||
|
|
||||||
|
/* as msgs[0] already has a message in it, copy that to curr_msg
|
||||||
|
* and use that in the loop first, then read more messages
|
||||||
|
*/
|
||||||
|
strncpy(curr_msg, msgs[0], strlen(msgs[0]));
|
||||||
|
curr_msg[strlen(msgs[0])] = '\0';
|
||||||
|
|
||||||
|
do {
|
||||||
|
if (is_seperating_line(curr_msg)) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* the message without alphanumeric characters */
|
||||||
|
msg_t new_msg;
|
||||||
|
|
||||||
|
/* the current character length of new_msg */
|
||||||
|
int len = 0;
|
||||||
|
|
||||||
|
for (int j = 0; j <= (int)strlen(curr_msg); j++) {
|
||||||
|
if (!isalnum(curr_msg[j])) {
|
||||||
|
new_msg[len++] = curr_msg[j];
|
||||||
|
}
|
||||||
|
}
|
||||||
|
new_msg[len] = '\0';
|
||||||
|
|
||||||
|
/* Copy the edited message to msgs[] */
|
||||||
|
strncpy(msgs[*num_msgs], new_msg, len);
|
||||||
|
msgs[*num_msgs][len] = '\0';
|
||||||
|
|
||||||
|
/* prepare for the next message to be read */
|
||||||
|
read_one_msg(curr_msg, MAX_MSG_LENGTH);
|
||||||
|
*num_msgs += 1;
|
||||||
|
} while (*num_msgs <= MAX_NUM_MSGS);
|
||||||
|
|
||||||
|
for (int i = 0; i < *num_msgs; i++) {
|
||||||
|
printf("%s\n", msgs[i]);
|
||||||
|
}
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 3: removing extra commas */
|
||||||
|
void
|
||||||
|
stage_three(msg_t msgs[], int num_msgs) {
|
||||||
|
print_stage_header(STAGE_NUM_THREE);
|
||||||
|
int i, curr_msg_len;
|
||||||
|
msg_t curr_msg;
|
||||||
|
|
||||||
|
for (i = 0; i < num_msgs; i++) {
|
||||||
|
/* copy the current message stored in msgs[i] to curr_msg */
|
||||||
|
curr_msg_len = strlen(msgs[i]);
|
||||||
|
strncpy(curr_msg, msgs[i], curr_msg_len);
|
||||||
|
curr_msg[curr_msg_len] = '\0';
|
||||||
|
|
||||||
|
/* remove extra commas from curr_msg */
|
||||||
|
remove_leading_commas(curr_msg, curr_msg_len);
|
||||||
|
curr_msg_len = strlen(curr_msg);
|
||||||
|
remove_trailing_commas(curr_msg, curr_msg_len);
|
||||||
|
curr_msg_len = strlen(curr_msg);
|
||||||
|
remove_consecutive_commas(curr_msg, curr_msg_len);
|
||||||
|
curr_msg_len = strlen(curr_msg);
|
||||||
|
|
||||||
|
/* Clear the current message stored in msgs[i] and replace
|
||||||
|
* with the edited message stored in curr_msg
|
||||||
|
*/
|
||||||
|
msgs[i][0] = 0;
|
||||||
|
strncpy(msgs[i], curr_msg, strlen(curr_msg));
|
||||||
|
msgs[i][curr_msg_len] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int j = 0; j < num_msgs; j++) {
|
||||||
|
printf("%s\n", msgs[j]);
|
||||||
|
}
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 4: reading the dictionary and finding the longest emoticon */
|
||||||
|
void
|
||||||
|
stage_four(emtcn_t emtcns[], int *num_emtcns) {
|
||||||
|
print_stage_header(STAGE_NUM_FOUR);
|
||||||
|
|
||||||
|
/* the emoticon to be read */
|
||||||
|
emtcn_t new_emtcn;
|
||||||
|
|
||||||
|
while (*num_emtcns <= MAX_NUM_EMTCN) {
|
||||||
|
read_one_msg(new_emtcn, MAX_EMTCN_LENGTH);
|
||||||
|
/* break as soon as the line is empty */
|
||||||
|
if ((int)strlen(new_emtcn) == 0) {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
strncpy(emtcns[*num_emtcns], new_emtcn, strlen(new_emtcn));
|
||||||
|
emtcns[*num_emtcns][(int)strlen(new_emtcn)] = '\0';
|
||||||
|
*num_emtcns += 1;
|
||||||
|
}
|
||||||
|
emtcn_t max_emtcn;
|
||||||
|
int max_emtcn_len = 0, curr_len, i, j;
|
||||||
|
for (i = 0; i < *num_emtcns; i++) {
|
||||||
|
/* get the length of emoticon, and compare it to the max length */
|
||||||
|
for (j = 0; j < (int)strlen(emtcns[i]); j++) {
|
||||||
|
if (emtcns[i][j] == ',') {
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
curr_len = j;
|
||||||
|
|
||||||
|
if (curr_len > max_emtcn_len) {
|
||||||
|
max_emtcn_len = curr_len;
|
||||||
|
strncpy(max_emtcn, emtcns[i], j);
|
||||||
|
max_emtcn[j] = '\0';
|
||||||
|
}
|
||||||
|
}
|
||||||
|
printf("Emoticon total: %d\nLongest: %s\nLength: %d\n",
|
||||||
|
*num_emtcns, max_emtcn, max_emtcn_len);
|
||||||
|
printf("\n");
|
||||||
|
}
|
||||||
|
|
||||||
|
/* stage 5: removing invalid emoticons with the help of the dictionary */
|
||||||
|
void
|
||||||
|
stage_five(msg_t msgs[], int num_msgs, emtcn_t emtcns[], int num_emtcns) {
|
||||||
|
print_stage_header(STAGE_NUM_FIVE);
|
||||||
|
int i, j;
|
||||||
|
|
||||||
|
/* the length of current message from msgs[] */
|
||||||
|
int curr_msg_len = 0;
|
||||||
|
|
||||||
|
/* the current emtcn from msgs[] */
|
||||||
|
emtcn_t curr_emtcn;
|
||||||
|
int curr_emtcn_len = 0;
|
||||||
|
|
||||||
|
/* the index of the curr_emtcn from msgs[] */
|
||||||
|
int curr_offset = 0;
|
||||||
|
|
||||||
|
for (i = 0; i < num_msgs; i++) {
|
||||||
|
for (j = 0; msgs[i][j] != '\0'; j++) {
|
||||||
|
/* do nothing, count characters before \0 */
|
||||||
|
}
|
||||||
|
curr_msg_len = j;
|
||||||
|
|
||||||
|
while (curr_offset < curr_msg_len) {
|
||||||
|
/* get the next emoticon, check if it's in emtcns, and remove it
|
||||||
|
* from msgs[i] if its not in emtcns
|
||||||
|
*/
|
||||||
|
get_next_emtcn(msgs[i], curr_emtcn, &curr_emtcn_len, &curr_offset);
|
||||||
|
|
||||||
|
if (!is_in_dict(curr_emtcn, curr_emtcn_len, emtcns, num_emtcns)) {
|
||||||
|
/* this is much easier to do with strncat, but can't be used
|
||||||
|
* here due to assignment restrictions
|
||||||
|
*/
|
||||||
|
remove_curr_emtcn(msgs[i], curr_emtcn_len, \
|
||||||
|
(curr_offset - curr_emtcn_len - 1), \
|
||||||
|
&curr_msg_len);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
curr_msg_len = 0;
|
||||||
|
curr_offset = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (i = 0; i < num_msgs; i++) {
|
||||||
|
if (msgs[i][0] == '\0') {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
printf("%s\n", msgs[i]);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/*
|
||||||
|
* _ _ _ _
|
||||||
|
* /\ | | (_) | | | |
|
||||||
|
* / \ | | __ _ ___ _ __ _ | |_ | |__ _ __ ___ ___
|
||||||
|
* / /\ \ | | / _` | / _ \ | '__| | | | __| | '_ \ | '_ ` _ \ / __|
|
||||||
|
* / ____ \ | | | (_| | | (_) | | | | | | |_ | | | | | | | | | | \__ \
|
||||||
|
* /_/ \_\ |_| \__, | \___/ |_| |_| \__| |_| |_| |_| |_| |_| |___/
|
||||||
|
* __/ |
|
||||||
|
* |___/
|
||||||
|
* ______ _
|
||||||
|
* /\ | ____| | |
|
||||||
|
* / \ _ __ ___ | |__ _ _ _ __ | |
|
||||||
|
* / /\ \ | '__| / _ \ | __| | | | | | '_ \ | |
|
||||||
|
* / ____ \ | | | __/ | | | |_| | | | | | |_|
|
||||||
|
* /_/ \_\ |_| \___| |_| \__,_| |_| |_| (_)
|
||||||
|
*
|
||||||
|
*/
|
||||||
BIN
program.exe
Normal file
BIN
program.exe
Normal file
Binary file not shown.
16
test0.txt
Normal file
16
test0.txt
Normal file
|
|
@ -0,0 +1,16 @@
|
||||||
|
That,was,really,funny,=)),:))
|
||||||
|
I,have,no,clue,:/,:?,on,this,matter
|
||||||
|
^-^,You,are,the,best,*-*,:-*
|
||||||
|
See,you,|->,bye
|
||||||
|
Thank,you,:)
|
||||||
|
###
|
||||||
|
:),happy
|
||||||
|
:)),happy
|
||||||
|
^-^,happy
|
||||||
|
:?,confused
|
||||||
|
:/,confused
|
||||||
|
=)),fun
|
||||||
|
:(,sad
|
||||||
|
:((,sad
|
||||||
|
**_**,love
|
||||||
|
:-*,love
|
||||||
32
test0_exp.txt
Normal file
32
test0_exp.txt
Normal file
|
|
@ -0,0 +1,32 @@
|
||||||
|
Stage 1
|
||||||
|
==========
|
||||||
|
Number of tokens: 6
|
||||||
|
|
||||||
|
Stage 2
|
||||||
|
==========
|
||||||
|
,,,,=)),:))
|
||||||
|
,,,,:/,:?,,,
|
||||||
|
^-^,,,,,*-*,:-*
|
||||||
|
,,|->,
|
||||||
|
,,:)
|
||||||
|
|
||||||
|
Stage 3
|
||||||
|
==========
|
||||||
|
=)),:))
|
||||||
|
:/,:?
|
||||||
|
^-^,*-*,:-*
|
||||||
|
|->
|
||||||
|
:)
|
||||||
|
|
||||||
|
Stage 4
|
||||||
|
==========
|
||||||
|
Emoticon total: 10
|
||||||
|
Longest: **_**
|
||||||
|
Length: 5
|
||||||
|
|
||||||
|
Stage 5
|
||||||
|
==========
|
||||||
|
=)),:))
|
||||||
|
:/,:?
|
||||||
|
^-^,,:-*
|
||||||
|
:)
|
||||||
14
test1.txt
Normal file
14
test1.txt
Normal file
|
|
@ -0,0 +1,14 @@
|
||||||
|
You,only,live,once,:),live,happy,>:<
|
||||||
|
**_**,concert,in,town
|
||||||
|
That,was,unexpected,:(,:'(,:(
|
||||||
|
Thank,you,:-)
|
||||||
|
:))),I,told,you,:#,:),:#
|
||||||
|
###
|
||||||
|
:|,emotion-less
|
||||||
|
:),happy
|
||||||
|
:)),happy
|
||||||
|
:(,sad
|
||||||
|
:'(,sad
|
||||||
|
:?,confused
|
||||||
|
:-*,love
|
||||||
|
>:<,love
|
||||||
31
test1_exp.txt
Normal file
31
test1_exp.txt
Normal file
|
|
@ -0,0 +1,31 @@
|
||||||
|
Stage 1
|
||||||
|
==========
|
||||||
|
Number of tokens: 8
|
||||||
|
|
||||||
|
Stage 2
|
||||||
|
==========
|
||||||
|
,,,,:),,,>:<
|
||||||
|
**_**,,,
|
||||||
|
,,,:(,:'(,:(
|
||||||
|
,,:-)
|
||||||
|
:))),,,,:#,:),:#
|
||||||
|
|
||||||
|
Stage 3
|
||||||
|
==========
|
||||||
|
:),>:<
|
||||||
|
**_**
|
||||||
|
:(,:'(,:(
|
||||||
|
:-)
|
||||||
|
:))),:#,:),:#
|
||||||
|
|
||||||
|
Stage 4
|
||||||
|
==========
|
||||||
|
Emoticon total: 8
|
||||||
|
Longest: :))
|
||||||
|
Length: 3
|
||||||
|
|
||||||
|
Stage 5
|
||||||
|
==========
|
||||||
|
:),>:<
|
||||||
|
:(,:'(,:(
|
||||||
|
,,:),
|
||||||
Loading…
Reference in a new issue