-
一个小型词法分析器,我编译课的课堂作业!
一个小型词法分析器,我编译课的课堂作业!-a small lexical analyzer, I compile a classroom course work!
- 2022-04-29 13:03:06下载
- 积分:1
-
Full support for extended regular expressions (those with intersection and compl
Full support for extended regular expressions (those with intersection and complement); Support for some kinds of cycles in grammar; DFA-based operation; Unicode support; C++ only, requires a modern compiler; Lexical analyzers can be configured to get symbols from any input class (built-in support for std::istream, std::wistream and FILE *); Designed to work with Whale, but can work standalone or interface to other parsers.-Full support for extended regular expressions (those with
intersection and complement); Support for some kinds of cycles in
grammar; DFA-based operation; Unicode support; C only, requires a
modern compiler; Lexical analyzers can be configured to get symbols
from any input class (built-in support for std::istream, std::wistream
and FILE*); Designed to work with Whale, but can work standalone or
interface to other parsers.
- 2022-05-27 12:54:56下载
- 积分:1
-
词法分析器(编译原理)
词法分析器(编译原理)- Morphology analyzer (translation principle)
- 2022-09-03 23:20:02下载
- 积分:1
-
一个非常完整的编译程序,有每个语法的代码,
一个很全的编译器程序,有各种文法的代码,各种方法都分开写的- A very entire compiler procedure, has each grammar the code,
each method all separates writes
- 2022-12-27 07:00:03下载
- 积分:1
-
Anti
反编译工具,可以自动升级,net反编译优秀-Anti-compilation tools
- 2022-05-05 20:03:33下载
- 积分:1
-
正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西
正则式到有穷自动机 最近刚学了编译原理 搞出来得这个东西-to DFA has recently compiled a study of the principles of producing more things
- 2022-06-15 14:07:55下载
- 积分:1
-
魔王语言 改进班的
魔王语言 改进班的 -fiendish language classes to improve
- 2022-03-18 01:28:48下载
- 积分:1
-
shpf 1.9一个并行编译器,自动的将串行fortran程序转换成并行的mpi程序。...
shpf 1.9一个并行编译器,自动的将串行fortran程序转换成并行的mpi程序。-shpf 1.91 parallel compilers, are automatic transform the
serial fortran procedure the parallel mpi procedure.
- 2022-08-15 05:55:49下载
- 积分:1
-
词法分析的小程序,对学编译原理的同学是个好例子
词法分析的小程序,对学编译原理的同学是个好例子-lexical analysis of small programs, compiler theory for school students is a good example
- 2022-01-29 04:13:52下载
- 积分:1
-
解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式....
解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original
grammar, after equal in value grammar establishment grammar tree which
eliminates the left recursion, after but the grammar tree carries on
the root to spread the calendar regarding this, after then obtains
decorates the type
- 2022-01-22 17:47:18下载
- 积分:1