#include "define.h"
#include
#include
#include
#include
FILE *fp
/*//////////////////////////////////////////////////////////////////////////////
This is a pretreatment.
/////////////////////////////////////////////////////////////////////////////*/
void readIntoBuffer(char buffer[256])
{
char ch1
char temp
int i
for(i=0 i
输入已经消除左递归的以及提取公共左因子的LL(1)文法,再输入相应的表达式,若分析成功,则在递归输出过程中输出"acc",若不成功,则有相应的报错以及位置指名。注意,要把同一个非终结符的产生式分成单个输入。他会自动计算first,follow,预测分析表的构造,但并不输出。-importation has been eliminated and left recursive public from the left-LL (1) grammar, further importation of the corresponding expression, if the analysis is successful, the output of the recursive process output "belongs", if successful, there were errors and the corresponding location named. Attention, we should end with a non-escalation of production into a single input. He will be automatically calculated first, follow, and predicting and analyzing the table structure, but does not export.
Shorthand是一个强大的脚本语言,是专门为基于Web的应用程序设计的。它的语法简单直观易于学习。它的引擎可在所有的 Linux 和Windows平台的流行Web服务器上运行。它支持 MySQL 和ODBC,以便用最普通的数据格式化。-Shorthand is a powerful scripting language that is specifically for Web-based application design. Its syntax is simple and intuitive and easy to learn. The engine in all the Linux and Windows platforms popular Web servers. It supports ODBC and MySQL to use the most common data format.
语法分析器(C++)源代码+其详细的课程设计报告
输入的文法可以消除左递归并提取公共左因子求出文法的非终结集合――FIRST和FOLLOW集并对输入的算符优先文法,构造算符优先关系表
-Parser (C++) Source code its detailed report on curriculum design input left recursive grammar can be eliminated and the public left factor extract derived grammar of non-end collection- FIRST and FOLLOW set of the input operator priority grammar, operator precedence relations structure table
此为编译原理的实验,与大学生本科生的教学内容相近,十分有用-to compile this principle experiments, the number of undergraduate students and teaching contents are similar, very useful! !
一个basic语言的解释器,界面及功能均比较的cool,希望能给各位有点帮组-a basic language interpreter, interface and functions comparable cool, in hopes of giving you a little help group
encode.v The encoder
syndrome.v Syndrome generator in decoder
berlekamp.v Berlekamp algorithm in decoder
chien-search.v Chien search and Forney algorithm in decoder
decode.v The top module of the decoder
inverse.v Computes multiplication inverse of an Galois field element
test-bench.v The test fixture, and some brief notes on using the modules.
data-rom.v A simple data source for testing
run For those intelligence-challenged who can t run verilog
LGPL The license
-encode.v syndrome.v Syndrome generator in decoder al berlekamp.v Berlekamp gorithm in decoder chien- search.v Chien searc h and Forney in decoder algorithm decode.v The t op module of the decoder inverse.v Computes intercommunication tiplication inverse of an element over Galois field test-bench.v The test fixture. and some brief notes on using the modules. data- rom.v A simple data source for testing run For th PNA intelligence-challenged who can not run veri The log LGPL license