Welcome![Sign In][Sign Up]
Location:
Search - scanner parser compiler

Search list

[Other resourceCocoSourcesCS

Description: The Compiler Generator Coco/R Coco/R1 is a compiler generator, which takes an attributed grammar of a source language and generates a scanner and a parser for this language. The scanner works as a deterministic finite automaton. The parser uses recursive descent. LL(1) conflicts can be resolved by a multi-symbol lookahead or by semantic checks. Thus the class of accepted grammars is LL(k) for an arbitrary k. There are versions of Coco/R for Java, C#, C++, Delphi, Modula-2, Oberon and other languages. This manual describes the versions for C# and Java implemented at the
Platform: | Size: 42373 | Author: yy | Hits:

[ELanguageCFGReader

Description: compiler-compiler. This is a compiler-compiler with table-driven scanner, table-driven parser.-compiler - compiler. This is a compiler - co mpiler with table-driven scanner. table-driven parser.
Platform: | Size: 351944 | Author: nick huang | Hits:

[Other resourceCocoSourcesCS

Description: The Compiler Generator Coco/R Coco/R1 is a compiler generator, which takes an attributed grammar of a source language and generates a scanner and a parser for this language. The scanner works as a deterministic finite automaton. The parser uses recursive descent. LL(1) conflicts can be resolved by a multi-symbol lookahead or by semantic checks. Thus the class of accepted grammars is LL(k) for an arbitrary k. There are versions of Coco/R for Java, C#, C++, Delphi, Modula-2, Oberon and other languages. This manual describes the versions for C# and Java implemented at the-The Compiler Generator Coco/RCoco/R1 is a compiler generator, which takes an attributed grammar of a source languageand generates a scanner and a parser for this language. The scanner works as adeterministic finite automaton. The parser uses recursive descent. LL (1) conflicts can beresolved by a multi-symbol lookahead or by semantic checks. Thus the class of acceptedgrammars is LL (k) for an arbitrary k.There are versions of Coco/R for Java, C#, C++, Delphi, Modula-2, Oberon and otherlanguages. This manual describes the versions for C# and Java implemented at the
Platform: | Size: 41984 | Author: yy | Hits:

[ELanguageCFGReader

Description: compiler-compiler. This is a compiler-compiler with table-driven scanner, table-driven parser.-compiler- compiler. This is a compiler- co mpiler with table-driven scanner. table-driven parser.
Platform: | Size: 351232 | Author: nick huang | Hits:

[Windows Developcminus_scnanerandparser_by_lexandyacc

Description: 使用lex和yacc写的cminus 编译器的scanner和parser-The use of lex and yacc compiler written cminus the scanner and parser
Platform: | Size: 282624 | Author: 林克 | Hits:

[ELanguageMicro-compiler

Description: 一个简单的 micro 语言编译器,其包括 scanner,parser,code generator 并使用 php 开发。-A simple compiler for Micro language which include scanner,parser,code generator and implement in PHP.
Platform: | Size: 57344 | Author: Newman | Hits:

[Windows DevelopExpression-Parser(Scanner)-compiler

Description: the purpose of this program is to parse expressions from an input file and display token type and value in an output file
Platform: | Size: 2048 | Author: majid | Hits:

[ELanguage20110915_src

Description: 建立一个针对LL(1)文法编译器的自动生成器。要完成此编译器的生成器需对源文件进行两遍处理:第一遍词法分析,第二遍语法分析。语法分析程序用LL(1)语法分析方法。首先输入定义好的文法书写文件(所用的文法可以用LL(1)分析),然后建立词法分析器,包括词法分析主程序、扫描器部分、关键字表等。经词法分析后分别计算所输入的文法的每个非终结符号的FIRST集合,每个非终结符号的FOLLOW集合,以及每个规则的SELECT集合,并判断任意一个非终结符号的任意两个规则的SELECT集的交集是不是都为空,如果是则输入文法符合LL(1)文法则可以进行分析。-For the establishment of a LL (1) grammar compiler automatic generator. To accomplish this compiler generator must deal with the source file twice: first pass lexical analysis, parsing the second time. Parser using LL (1) syntax analysis. First, write the input file defined grammar (grammar can be used in LL (1) analysis), and then create the lexical analyzer, including lexical analysis of the main program, scanner parts, keyword lists. The lexical analysis of the inputs were calculated for each non-terminal grammar symbol of the FIRST set of each non-terminal symbol FOLLOW set, and each set of the rule s SELECT and determine any non-terminal symbol of any two rules SELECT set intersection is not all empty, if it is in line with the input grammar LL (1) the text rule can be analyzed.
Platform: | Size: 37888 | Author: yin | Hits:

[ELanguageTinyP-Compiler

Description: C++实现Tiny+编译器课程实验,包含 (1) Scanner模块 (2) Parser模块 (3) Semantic模块 (4) Code Generator模块 -The achieve Tiny+ compiler course experiment C++ Parser module (3) Semantic module (4) Code Generator module contains (1) Scanner module (2)
Platform: | Size: 174080 | Author: | Hits:

[ELanguageScanneraParser

Description: 我的 通过C++实现的 C minus编译器(扫描器scanner&分析器parser) (ps:rar压缩文件,有部分中文名)-I realized through C++ C minus compiler (scanner scanner & parser parser) (ps: rar compressed files, some of the Chinese name)
Platform: | Size: 173056 | Author: 黄书郎 | Hits:

CodeBus www.codebus.net