用汇编和C写的32位C语言编译器，支持C++，也可编译Windows程序和DLL文件...

GCC and the PROGMEM Attribute.pdf, 介绍 GCC 编译器- GCC and the PROGMEM Attribute.pdf ， introduce gcc。

max-log-map算法的C语言的实现，能计算出所需要的LLR，做出软判决和硬判决。-max-log-map algorithm for the realization of the C language, can be required to calculate LLR, make a hard decision and soft decision.

TINY+编译器源码 语言表达式的定义 (1) ::= | (2) ::= ±|±| (3) ::= *|/| (4) ::= (5) ::= | (6) ::= or | (7) ::= and | (8) ::= |not (9) ::= | | | (10) ::= ||=| =-err

NEC 78k0 LX3系列的LCD 电压电流的显示表-NEC 78k0 LX3 series of LCD voltage and current display table

PLO编译器 vc++编写界面美观 人性化 可用与分析研究 -PLO compiler vc prepared beautiful interface can be humanized and analysis

在本编译程序中,源语言为PL/0语言,目标语言为假想栈式计算机的汇编语言.PL/0语言是Pascal语言的一个子集，PL/0的编译程序包括了对PL/0语言源程序进行分析处理、编译生成类PCODE代码，并在虚拟机上解释运行生成的类PCODE代码的功能。 　　PL/0语言编译程序采用以语法分析为核心、一遍扫描的编译方法。词法分析和代码生成作为独立的子程序供语法分析程序调用。语法分析的同时，提供了出错报告功能。在源程序没有错误编译通过的情况下，调用类PCODE解释程序解释执行生成的类PCODE代码。 该软件为PL/0语言编译程序,所实现的扩充功能如下: 1.增加单词：保留字 ELSE，FOR，TO, DOWNTO 2.增加运算 +=，-=，++，-- 3.不等号# 改为 4.增加条件语句的ELSE子句 5.扩充语句: ①FOR := TO DO ②FOR := DOWNTO DO 其中，语句①的循环变量的步长为1， 语句②的循环变量的步长为-1。 概述 源文件： *.plo 目标文件： *.COD 实现平台：C＋＋ Builder6.0 -the compiler, the source language of PL/0 language, target language of the imaginary stack of computer assembly language. PL/0 language Pascal language is a subset of, PL/0 compilers including the right PL/0 language source analysis, category PCODE compiler code generation and the virtual machine running on to explain the formation PCODE category code functions. PL/0 language compiler

词法语法分析，说明说明原理的词法分析和语法分析的全过程！-Lexical syntax analysis that the principle of lexical analysis and syntax analysis of the entire process!

在文本下编辑,把需要分析的程序写在zf-infile.txt内，程序的结尾必须以“@”标志符结束，程序结果输出在同目录内，文件名为zf-outfile.txt,此文件为自动生成。 - Edits under the text, the procedure which needs to analyze writes in zf-infile.txt, the procedure ending must the designator end by "@", the procedure result output in with the table of contents in, document named zf-outfile.txt, this document is the automatic production.

一个非常好的词法分析程序,加上语法的分析是一个难得一见的好实例-a very good lexical analysis procedure, in addition to the syntax analysis is a rare to see a good example

输入已经消除左递归的以及提取公共左因子的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.