搜索资源列表
KMPPatternMatching
- 利用串类型的KMP算法的简单实现。该算法可以较好的完成字符串的匹配。-KMP string type to use a simple algorithm to achieve. The algorithm can be better to complete the match string.
KMP
- 字符串匹配问题：输入主串和子串，通过算法实现字符串的匹配：若字串在主串中出现在输出出现的位置，否则匹配失败-String matching problem: Enter the main series and sub-string, through the string matching algorithm: if the string appeared in the main string appear in the output, or the failure to match
ConfMatch
- 实现配置文件和数据源数据串的匹配，数据源一组数据有首尾标识符，分隔符定义，配置文件有相应的格式说明，然后匹配并显示-The realization of the data source configuration file and the matching data string, the data source has both a set of data identifiers, delimiters defined, a corresponding configuration file f
automake.tar
- linux的源码编译工具的书籍 教你如何编写外 ·Firefox Secrets :document about f ·友善之臂MINI2440的说明介绍文档， ·这是快速学习matlab的ppt，对学习ma ·arm7tdmi内核的技术参考资料 关于 A ·华为工程师手册，在软硬件方面都有 ·全面的介绍了串口通信的知识，通过 ·三星s3c2410芯片的中文手册，难得一 ·驱动开发经验集锦。 ·经过本人加全目录的《LINUX内核源代 ·DSP仿真器的原理图
KMPandmax_match
- 1,KMP:实现了在一个字符串中查找字串的高效算法，复杂度为O（m+n） 2，max_match：求两个字符串的最大匹配字串 在vc6.0中调试通过，可以使用-1, KMP: realized in a string to find String efficient algorithm complexity is O (m+ n) 2, max_match: seeking two strings maximum matching string in the vc6.0 debug en
Cyclone_Series_Device_Thermal_Resistance
- cyclone系列FPGA的串行设备阻抗匹配设计指南-cyclone series FPGA Design Guide impedance matching of serial devices
Bruit_Fox_Algorithm
- 朴素的模式匹配算法，也称布鲁特-福斯算法，实现子串的定位操作。-Simple pattern matching algorithm, also known as the bruit- Fox algorithm to achieve sub-string positioning operation.
match
- 判断一个字符串和一个通配符串是否能够匹配，可以任意方式输入通配符-To determine a string and is able to match a wildcard string, you can enter wildcard any way
ds_3
- 1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according
HStringapp
- 根据《数据结构》写了一个字符串操作基本函数，堆分配存储表示串(HString)。包括赋值，复制，比较，联接，子串，模式匹配(KMP)。主函数是使用例子。-According to " data structure" wrote a basic string operation functions, heap allocation of memory that string (HString). Including the assignment, copy, compare, l
khpp
- 利用栈的知识判断一串字符中的括号是否匹配问题。-Knowledge of the use of the stack to determine whether the string of characters in parentheses matching problem.
program
- 过滤一串字符中的敏感词汇，出算数题，字符匹配，longlongint处理-Filtering characters in a string of sensitive words, out arithmetic problems, character matching, longlongint deal
StrReplace
- 利用顺序存储的方式实现串的匹配与替换，已解决替换长度增加导致的内存溢出问题-The use of sequential storage means to achieve string matching and replacement,
EASYARM2103
- main.c---ADC程序 TIMER0 MAT_INT 定时器0匹配产生中断 TIMER1 MAT_OUTPUT 定时器1匹配输出翻转 TIMER1 PWM_OUTPUT 定时器1PWM输出 TIMER2 CAP_INT 定时器2捕获产生中断 UART0 Test:串口通信实验—查询方式 UART0 Interrupt Test：串口通信实验—中断方式-The Programme of EasyARM2103 ADC TIMER0 MAT_INT TIMER1
Stringpatternmatching
- Stringpatternmatching 实现模式串与主字符串的模式匹配-Stringpatternmatching Achieve the pattern string with the main string pattern matching
kmp
- 串的模式匹配可以从模式p的p[k]开始与正文t的t[j+i]开始依次比较，（若p[k]==t[j+i]继续比较p[k+1]=？=t[j+i+1]直至出现p[k+l]！=t[j+i+l-1]时，重新寻找新的p[k+l]的那个最大k 然后再比较p[k ]=？=t[j+i+l]直至匹配或遍历结束）。省去了前面的k次比较。当对应p[i]的k有多个，取最大的k。-Pattern matching string from the pattern p, p [k] started with the body
newkmp
- 串的模式匹配 按要求从主串中找出子串对应的位置，并加以输出-String pattern matching required to find out from the main string of the corresponding sub-string position, and make the output
RegEx2NFA_RC
- 由正则表达式构造NFA的程序，并可以对输入串模拟正则表达式匹配-This is a C program used in compiling the given regular expression into an equivalent epsilon-NFA, simulated through tracking State sets.
RegEx2NFA2DFA_RC
- 由正则表达式构造DFA的程序，并可以对输入串模拟正则表达式匹配-This is a C program used in compiling the given regular expression into an equivalent DFA, simulated through tracking State sets.
KMP
- 使用KMP算法能减少完成的串模式匹配的回溯，因此该算法每当一趟匹配过程中出现字符比较不等时，不需要回溯i指针，而是利用已匹配到的“部分匹配”的结果将模式右滑尽可能远的一段距离进行比较-KMP algorithm can reduce the use of string pattern matching complete retrospective, so the algorithm whenever the character appears in a visit the matching pr