标签：epo about 游戏 lan 控制 bat 外挂 info 人工
Implement a DFA simulator (in C, C++ or Python) in a Linux environment:
? Read in a specified machine (5-tuple definition) and process input strings against this DFA;
output ACCEPT or NOT ACCEPT for each input string.
? All error checking must be performed including command line argument parsing, valid
definition file, valid input string etc.
? Full help usage must be provided which should be self sufficient to run the program.
? Input string is read from stdin which means following should work
? ./dfa -d m1.dfa <m1.in
? ./dfa -d m1.dfa <m1.in >m1.out
? cat m1.in | ./dfa -d m1.dfa
? -v option should provide verbose information on the working of the machine; for example
display the definition of the machine, transitions as input is processed etc.
Deliverables
? Source files
? Sample Input/output
? Define 3 machines: 1.6 b, c, f [Homework #2] and show at least 3 ACCEPT and 3 NOT
ACCEPT examples for each.
? Define machine for a*.c—as done in class; show at least 3 ACCEPT and 3 NOT ACCEPT
examples
? You can show other examples too.
? 1 page report : Write about issues faced, lessons learned, any remaining bugs etc.
? Create a directory firstname.lastname/pn where n is the assignment number and store all the
files in this directory.
Extra Credit
? [3 points] in additon, support json definition for machine; read machine defined in json; also
output json for machine definition in verbose mode;
? [7.5 points] implement NFA with the same functionality.
? [7.5 points] implement in another language—python or C++ or C
? [5 points] show visualization and draw the machine
? think of other command line options which could be useful.
? any other functionality …. – please document in report and code.
Deadline and Late Submissions
? The assignment is due on the date specified above at 11:59:59 PM
? Each day late will incur a penalty of 5% of the grade for the assignment; for example, if the
assignment is 3 days late, the maximum grade will
be 85 out of 100—15 will be subtracted
from whatever grade is assigned.
Sample Run
[The sample output below is my implementation and is provided as a reference; please feel free to
change/improve this when you implement.]
Usage:
./dfa-h -d <dfafile> -v
This is a simple DFA Implementation. The DFA definition
is specified via .dfa file; input string is read from stdin.
In non-verbose mode, print ACCEPT or NOT ACCEPT as the case may be.
-h
print usage
-d <dfafile>
DFA definition file
-v
verbose mode; display machine definition, transitions etc.
Example:
./dfa -d m1.dfa
Example dfa definition file m1.dfa
# DFA M1 from Page 36 of ITC Text;
states: q1 q2 q3
alphabet: 0 1
startstate: q1
finalstate: q2
transition: q1 0 q1
transition: q1 1 q2
transition: q2 0 q3
transition: q2 1 q2
transition: q3 0 q2
transition: q3 1 q2
Example run in interactive mode:
$ ./dfa -d m1.dfa
00011
00011 --> ACCEPT
00100
00100 --> ACCEPT
00000
00000 --> NOT ACCEPT
00000 --> NOT ACCEPT
Interactive Run:
$ ./dfa -d m1.dfa
00000
00000 --> NOT ACCEPT
11111
11111 --> ACCEPT
01010
01010 --> NOT ACCEPT
00100
00100 --> ACCEPT
00201
Invalid alphabet: 2; IGNORING rest of input
00201 --> NOT ACCEPT
11100
11100 --> ACCEPT
00a11
Invalid alphabet: a; IGNORING rest of input
00a11 --> NOT ACCEPT
110011
110011 --> ACCEPT
110011 --> ACCEPT
Use of Pipe and Redirection for input:
$ cat m1.in
00000
11111
00100
001001
001000
0010001
$ cat m1.in | ./dfa -d m1.dfa
00000 --> NOT ACCEPT
11111 --> ACCEPT
00100 --> ACCEPT
001001 --> ACCEPT
001000 --> NOT ACCEPT
0010001 --> ACCEPT
0010001 --> ACCEPT
$ ./dfa -d m1.dfa <m1.in
00000 --> NOT ACCEPT
11111 --> ACCEPT
00100 --> ACCEPT
001001 --> ACCEPT
001000 --> NOT ACCEPT
0010001 --> ACCEPT
0010001 --> ACCEPT
Interactive Run with -v flag:
$ ./dfa -d m1.dfa -v
---BEGIN DFA definition---
States:
q1 q2 q3
Alphabet:
0 1
StartState: q1
FinalState:
q2
Transitions:
q1 0 q1
q1 1 q2
q2 0 q3
q2 1 q2
q3 0 q2
q3 1 q2
---END DFA definition---
001100
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
001100 --> ACCEPT
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
001100 --> ACCEPT
Use of Pipe and Redirection for input with -v flag:
$ ./dfa -d m1.dfa -v <m1.in >m1.out
$
$ cat m1.out
---BEGIN DFA definition---
States:
q1 q2 q3
Alphabet:
0 1
StartState: q1
FinalState:
q2
Transitions:
q1 0 q1
q1 1 q2
q2 0 q3
q2 1 q2
q3 0 q2
q3 1 q2
---END DFA definition---
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
00000 --> NOT ACCEPT
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
11111 --> ACCEPT
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
00100 --> ACCEPT
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
Current State: q2 Symbol: 1 -> New State: q2
001001 --> ACCEPT
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
001000 --> NOT ACCEPT
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 1 -> New State: q2
0010001 --> ACCEPT
本团队核心人员组成主要包括硅谷工程师、BAT一线工程师，国内Top5硕士、博士生，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。
我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写代做编程语言或工具包括但不限于以下范围:
C/C++/C#代写
Java代写
IT代写
Python代写
辅导编程作业
Matlab代写
Haskell代写
Processing代写
Linux环境搭建
Rust代写
Data Structure Assginment 数据结构代写
MIPS代写
Machine Learning 作业 代写
Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导
Web开发、网站开发、网站作业
ASP.NET网站开发
Finance Insurace Statistics统计、回归、迭代
Prolog代写
Computer Computational method代做
因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：99515681@qq.com 微信：codinghelp
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 0 -> New State: q1
Current State: q1 Symbol: 1 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 0 -> New State: q2
Current State: q2 Symbol: 0 -> New State: q3
Current State: q3 Symbol: 1 -> New State: q2
0010001 --> ACCEPT
http://www.daixie0.com/contents/3/1233.html
代写C, C++ or Python 作业，Linux environment下编程代写C, C++ or Python 作业代写
标签：epo about 游戏 lan 控制 bat 外挂 info 人工
原文地址：https://www.cnblogs.com/codinghelp/p/8877086.html
