搜索资源列表
LL1 grammer
- vc++实现编译原理中的LL(1)文法的编译过程,非常好用.-vc realization of the principle of compiler LL (1) grammar compiler course, very handy.
guize
- The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first charact
bianyi
- ① 对输入文法，由程序自动构造FIRST FOLLOW集 ② 对输入文法，由程序自动生成它的LL(1)分析表； ③ 对于给定的输入串，应能判断识别该串是否为给定文法的句型。
bianyizlh
- 自动生成一个LL(1)文法。对输入文法，由程序自动生成它的LL(1)分析表；对于给定的输入串，应能判断识别该串是否为给定文法的句型-LL (1) grammar. On the importation of grammar, automatically generated from the LL (1) Analysis Table; For a given input string, Recognition should be able to judge whether the series
Scanner
- /利用递归下降分析程序,解决下列满足LL(1)条件的文法 //消除递归前的文法 消除递归后的等价文法
mp3_toolbox
- 基于matlab的mp3的读写函数Mp3 toolbox for Matlab. Alfredo Fernandez Franco Aalborg University Departament of Acoustics M.Sc. Student aberserk@yahoo.com Includes 2 functions to write and read MP3 files. It works like the commands WAVWRITE and WAVREAD. 1.- Just
trnn
- 神经网络训练，应用matlab7NN包，用一个隐藏层使用5折交叉验证。-Training the Neural Network This scr ipt is something that I did for a course at Uni. It uses the Neural Networking package provided with MatLab 7 unfortunately I m not sure if it s available with the earlier ve
delphifastzlib114
- zlibyou can found an optimized version of Zlib 1.1.4 that you can embed into every Delphi executable without use external dlls. Further I have build a little example hoping to aid "young" Delphi programmers getting in trouble with streams... P
rbtree
- 红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n). In practice, the
LL(1)
- LL(1)语法分析1、实现LL(1)分析中控制程序（表驱动程序）； 2、完成以下描述算术表达式的LL(1)文法的LL(1)分析程序。 G[E]: E→TE′ E′→ATE′|ε T→FT′ T′→MFT′|ε F→ (E)|i A→+|- M→*|/-LL (1) syntax analysis 1, the realization of LL (1) Analysis of control procedures (table-driven procedure
LL_Path_optimization
- 【系统功能】 LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。 【主要算法】 1：利用Prim算法求解带约束条件的连通图的最小生成树； 2：利用基于单亲遗传算法求解带约束条件的TSP问题。 -【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest p
LL1wenfapanding
- LL(1)文法使用的是确定的自顶向下的分析技术。LL(1)的含义是：第一个L表明自顶向下分析是从左向右扫描输入串，第2个L表明分析过程中将使用最左推导，1表明只需向右看一个符号便可决定如何推导，即选择哪个产生式(规则)进行推导。-LL (1) grammar is used to determine the top-down analysis techniques. LL (1) the meaning is: the first show that L is top-down analysis
nsa
- Negative Selection Agorithm 1. we have a signal which we ll monitor 2. we produce lymphocytes - length lyphocyte as a signal, we take random numbers 3. NSA... we check that lymphocyte is different from signal, if not we random another 4. n
CPP_Make_the_to_calculate
- 利用以下公式,计算 PI 至小数点后s位 oo --- n L * PI \ (-1) 4 * L L -------- = / [ ------- ( ---------- - -------------- ) ] 4 --- 2n+1 5^(2n+1) 239^(2n+1) n=0 L : 为一大整数 10^s PI : 圆周率-Using the following formula to calculate PI to s
hmmbox_4_1
- the newer version from HMMbox 3.2 Matlab toolbox for Variational estimation Hidden Markov Models. (Adapted from Hidden Markov Toolbox Version 3.3 01-Apr-99 and Coupled Hidden Markov Toolbox Version 1.1 01-Feb-01 Copyright (c) by Iead Re
maphmmbox
- VARHMMBOX, version 1.1, Iead Rezek, Oxford University, MAR 2002 Matlab toolbox for Hidden Markov Models (Adapted from Machine Learning Toolbox Version 1.0 01-Apr-96 Copyright (c) by Zoubin Ghahramani, University of Toronto) The softwa
(mima)[1]
- 虚拟万用表4060模拟，你可以看看的哦！对你绝对有用的！-Virtual analog multimeter 4060, you can look at the oh! I' ll never be useful!
Prediction_program
- 对于任意输入的一个LL(1)文法，构造预测分析程序，输出输入串的自动匹配过程。首先实现集合FIRST(X)构造算法和集合FOLLOW(A)构造算法，再实现预测分析表构造算法。再构造预测分析程序，输出字符串的自动匹配过程。-For any input of a LL (1) grammar, structure prediction analysis program, import and export series of automatic matching process. First of
syntax
- LL(1)文法的实现。具体设计要求如下： 1. 可以使用任何语言来完成，例如：Java、C、C++。 2. 文法采用常用的方式进行描述，例如：S→aA。 3. 以文件方式读取文法。 4. 分别求出每一个非终结符FIRST 集FOLLOW集和SELECT集。 5. 画出预测分析表。 6. 判定读入的文法是否是LL(1)文法。 7. 给定的任意符号串判定是否是文法中的句子，将分析过程用计算机打印出来。 8. 查出文法中是否含有左递归或左公因子。若有则消除左公因子和左递
matlab_vrp(1)
- 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。 算法按照tsp问题去解决，但是在最后计算路径的时候有区别。 比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。 计算路径的时候把城市依次放入派送线路中, 每放入一个城市前，检查该城市放入后是否会超过车辆最大载重 如果没有超过就放入 如果超过，就重新开始一条派送路线 …… 直到最后一个城市放完 就会得到多条派送路线 这样处理比较简单可以把vrp问题转为tsp问题求解 但