从一个开源软件中摘取的正则表达式模块，是学习正则表达式、编译原理的好东西。...

是有关编译原理的,可以自动对输入的??分析,生成first集和follow集-The principle is the compiler can automatically entered?? Analysis, generated first set and follow set

生成Trick文件工具 1.Open command line 2.input tricktest Usage: TrickTest -f -o -i -f source mpeg2 file to trick -o trick output directory -i output file id -m max coding error, default 0 -b max bitrate for trick generate, default 0 mean no limit -s trick buffer block size, must be n*188 -l log file, default c: ricktest.log example: tricktest -f 黑鹰行动.mpg -o c: emp -i A -m 1000 -b 3750000 soure file: 黑鹰行动.mpg output directory: c: emp filename: 000000A,000000A.ff,000000A.fr,000000A.vvx max coding error: 1000 trick generation speed: 3750000 bps a-Trick document generation tool 1.Open command line 2.input tricktest Usage: TrickTest-f-o-i-f source mpeg2 file to trick-o trick output directory-i output file id-m max coding error, default 0-b max bitrate for trick generate, default 0 mean no limit-s trick buffer block size, must be n* 188-l log file, default c: tricktest.log example: tricktest-f Black Hawk operations. mpg-oc: temp-- i A-m 1000-b 3750000

将文本文挡的标识分开-to block texts from the logo

语法分析 C++ 原创 -Parsing C++ Original Ha Ha Ha Ha Ha Ha Ha Ha Ha ha ha ha

背包问题 采用分枝限界法解决0/1背包问题! 本人上机实习作业,通过老师验收,合格! 针对部分上机实习的同学可以来下~ -Knapsack problem using Branch and Bound method to solve 0/1 Knapsack Problem! My internship on the machine operation, through the teacher acceptance, qualified! The machine for some internship students can come to the next ~

卷积码编码器的实现，是误码性能分析的一部分-Implementation of convolutional encoder

实现NFA确定化子集算法程序。DFA是NFA的特例。对每个NFA 　N一定存在一个DFA　Ｍ ，使得 L(M)=L(N)。对每个NFA N存在着与之等价的DFA M。从NFA的矩阵表示中可以看出，表项通常是一状态的集合，而在DFA的矩阵表示中，表项是一个状态，NFA到相应的DFA的构造的基本思路是：1.DFA的每一个状态对应NFA的一组状态. 2. DFA使用它的状态去记录在NFA读入一个输入符号后可能达到的所有状态.。-achieve NFA Number algorithm to determine procedures. DFA NFA is a special case. NFA N for each must exist a DFA M, makes L (M) = L (N). N for each NFA exist with the DFA M equivalent. NFA from the matrix can be seen, tables are usually set of a state, and in the matrix DFA said, Form is a state of the corresponding NFA DFA basic structure of ideas : 1.DFA each one corresponds to a group of NFA state. 2. DFA use it to the state records in NFA Reading input into a symbol after all reach the state. .

词法分析，可识别关键字，整数，实数，标识符，有一定的提示操作界面-Lexical analysis can identify the keywords, integers, real numbers, identifiers, there are some tips user interface

Jode Decompiler.安装方法：点击Eclipse的Help菜单 --> Software Updates --> Find and install...，然后选择：Search for new features to install，在弹出的对话框中点击"New Remote Site..."菜单。填入：Name: Jode DecomopilerURL: http://www.technoetic.com/eclipse/update点击"Finish"。之后可以在Window菜单的Preferences --> Java -->Jode Decompiler中配置插件的信息。-Jode Decompiler. Installation method: Click Eclipse

同时论流刷定制的不同的网页同 时论流刷定制的不同的网页同时论流刷定制的不同的网页-while brushing customized flow of the different flow on the website while brushing customized website also different flow on the different brush customization On the website the same time brush customized flow of the different website