虫虫首页|资源下载|资源专辑|精品软件
登录|注册

Lexical

  • 开放式汇编器系统的设计

    汇编器在微处理器的验证和应用中举足轻重,如何设计通用的汇编器一直是研究的热点之一。本文提出了一种开放式的汇编器系统设计思想,在汇编语言与机器语言间插入中间代码CMDL(code mapping description language)语言,打破汇编语言与机器语言的直接映射关系,由此建立起一套描述汇编语言与机器语言的开放式映射体系。基于此开放式映射体系开发了一套汇编器系统,具有较高层次上的通用性和可移植性。【关键词】指令集,CMDL,汇编器,开放式 Design of Retargetable Assembler System Liu Ling Feng Wen Nan Wang Ying Chun Jiang An Ping Ji Li Jiu IME of Peking University, 100871【摘要】An assembler plays a very important role in the field of microprocessor verifications and applications, thus how to build a retargetable assembler system has been a hotspot in this field for long time. This paper presents a new method about the retargetable assembler system design.It provides a kind of language CMDL, code mapping description language. During the process of assembling, assembler languages are firstly translated to CMDL, and then mapped to the machine codes. In an other word, CMDL is inserted between assembler languages and machine codes during the translation procedure. As a medium code, CMDL has a lot of features, such as high extraction, strong descript capabilities. It can describe almost all attributes of assembler languages. By breaking the direct mapping relationship between assembler languages and machine codes, the complexities of machine codes are hided to the users, therefore, the new retargetable assembler system has higher retargetable level by converting the mapping from assembler languages and machine codes to assembler languages and CMDL, and implementationof it becomes easier. Based on the new mapping system structure, a retargetable assemblersystem is developed. It proved the whole system has good retargetability and implantability.【关键词】instruction set, symbol table, assembler, Lexical analysis, retargetability

    标签: 开放式 汇编器

    上传时间: 2013-10-09

    上传用户:meiguiweishi

  • Full support for extended regular expressions (those with intersection and complement); Support for

    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.

    标签: intersection expressions complement for

    上传时间: 2013-12-11

    上传用户:zhanditian

  • 计算所汉语词法分析系统ICTCLAS介绍 词是最小的能够独立活动的有意义的语言成分。 但汉语是以字为基本的书写单位

    计算所汉语词法分析系统ICTCLAS介绍 词是最小的能够独立活动的有意义的语言成分。 但汉语是以字为基本的书写单位,词语之间没有明显的区分标记,因此,中文词语分析是中文信息处理的基础与关键。为此,我们中国科学院计算技术研究所在多年研究基础上,耗时一年研制出了汉语词法分析系统ICTCLAS(Institute of Computing Technology, Chinese Lexical Analysis System),该系统的功能有:中文分词;词性标注;未登录词识别。分词正确率高达97%以上,未登录词识别召回率均高于90%,其中中国人名的识别召回率接近98%处理速度为31.5Kbytes/s。ICTCLAS的特色还在于:可以根据需要输出多个高概率结果,有多种输出格式,支持北大词性标注集,973专家组给出的词性标注集合。该系统得到了专家的好评,并有多篇论文在国内外发表。 计算所汉语词法分析系统ICTCLAS同时还提供一套完整的动态连接库ICTCLAS.dll和相应的概率词典,开发者可以完全忽略汉语词法分析,直接在自己的系统中调用ICTCLAS,ICTCLAS可以根据需要输出多个高概率的结果,输出格式也可以定制,开发者在分词和词性标注的基础上继续上层开发。

    标签: ICTCLAS 汉语 计算

    上传时间: 2014-01-02

    上传用户:15736969615

  • 此程序共有两个类

    此程序共有两个类,Lexical进行词法分析,Syntax进行语法分析.对于语法分析,采用LR(1)分析法,判断程序是否满足规定的结构

    标签: 程序

    上传时间: 2013-12-31

    上传用户:偷心的海盗

  • 语法分析器 此程序共有两个类

    语法分析器 此程序共有两个类,Lexical进行词法分析,Syntax进行语法分析.对于语法分析,采用LR(1)分析法,判断程序是否满足规定的结构.

    标签: 语法分析器 程序

    上传时间: 2013-12-04

    上传用户:四只眼

  • 一个词法分析编译器

    一个词法分析编译器,可以供学习之用。A Lexical analysis compiler can be used for learning,C-C

    标签: 编译器

    上传时间: 2013-12-09

    上传用户:zhengjian

  • 算符优先文法分析的c语言实现代码 需要输入词法分析的txt结果文件- The operator first grammar analysis c language realization code n

    算符优先文法分析的c语言实现代码 需要输入词法分析的txt结果文件- The operator first grammar analysis c language realization code needs to input the Lexical analysis the txt result document

    标签: realization analysis operator language

    上传时间: 2015-12-28

    上传用户:youlongjian0

  • Ictclas分词系统

    Ictclas分词系统,文词法分析是中文信息处理的基础与关键。中国科学院计算技术研究所在多年研究工作积累的基础上,研制出了汉语词法分析系统ICTCLAS(Institute of Computing Technology, Chinese Lexical Analysis System)

    标签: Ictclas

    上传时间: 2017-02-18

    上传用户:569342831

  • This is an implementation of double-array structure for representing trie, as proposed by Junichi A

    This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for Lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.

    标签: implementation double-array representing structure

    上传时间: 2013-12-10

    上传用户:shinesyh