首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
论文对在设计ATLAS-C语法分析器中YACC工具所无法解决的冲突进行了具体的讨论与研究,并且对出现的冲突提出了相应的解决方案。实验结果证明论文提出的消解冲突的方法在设计语法分析器时具有可行性。  相似文献   

2.
LALR(1)语法分析器的自动生成   总被引:2,自引:0,他引:2  
文章简单介绍了语法分析器自动生成的原理和技术,根据语法分析器的生成过程,介绍了实用的语法分析器的自动生成器各个部件及其实现的详细过程。  相似文献   

3.
汉语多重关系复句的关系层次分析   总被引:8,自引:0,他引:8       下载免费PDF全文
鲁松  白硕  李素建  刘群 《软件学报》2001,12(7):987-995
汉语多重关系复句的句法分析问题主要由复句中的关系分析和层次分析两部分组成.将多重关系复句中的层次分析作为研究对象.它是针对多种逻辑或并列关系,按照一定层次组成复杂主从关系复句而进行的关系层次分析过程.为了有效地形式化地表示多重关系复句的层次结构,提出了关系层次树的概念,并以此为基础构造文法,采用部分数据驱动的确定性移进-归约算法实现多重关系复句的关系层次分析.通过开放测试对计算机实现的多重关系复句句法分析器进行考察,93.56%的正确率使所提出的分析方法的有效性和正确性得到了充分的验证.  相似文献   

4.
从实际应用出发,研究UML模型转换器的设计与实现.本文分析了UML建模工具Rose所产生模型的文档结构,构造出其LALR(1)文法,利用YACC工具将其转换为统一的UML模型文档.  相似文献   

5.
简单网络管理协议帮助网络管理员实现对基于TCP/IP网络的分布式系统的有效管理。管理员在本地计算机上(通常是一个工作站)使用“取—存”模式完成对代理的各种控制,而代理通过对SNMP报文的分析将通信原语转换成等价的在本地数据结构上的操作。本文从SNMP基本体系结构入手,提出了一种基于VisualC 的实时监测系统中SNMP报文分析算法的实现。  相似文献   

6.
机器翻译中句法分析的设计与实现   总被引:2,自引:0,他引:2  
费鲲 《计算机工程与设计》2006,27(15):2832-2834,2838
论述了英汉机器翻译中句法分析的设计与实现方法。首先阐述了编译原理中句法分析的相关理论,并以此理论为依据提出了机器翻译中句法分析的具体实现。实现过程中,采用部分分析的思想,将一个句子划分为多个语法成分,分别对各语法成分进行分析,从而完成对待翻译句子的句法分析,给出句法树。  相似文献   

7.
汉语复句层次关系分析是中文信息处理领域极具挑战性的课题之一。为解决关系词标识信息不充足所导致的复句层次关系识别准确率下降问题,挖掘了影响分句关联的形式化语义知识,在此基础上构建了小句关联体识别算法并将其应用于相应的复句层次判定规则之中,以辅助分析其层次关系;对于其余单、多重有标复句的层次识别,使用基于搭配规则的移进-归约算法;最后提出了一种语义与规则相结合的复句层次分析模型。实验结果表明,此方法在一定程度上提高了复句层次关系识别的准确率。  相似文献   

8.
    
Big data is largely influencing business entities and research sectors to be more data‐driven. Hadoop MapReduce is one of the cost‐effective ways to process large scale datasets and offered as a service over the Internet. Even though cloud service providers promise an infinite amount of resources available on‐demand, it is inevitable that some of the hired virtual resources for MapReduce are left unutilized and makespan is limited due to various heterogeneities that exist while offering MapReduce as a service. As MapReduce v2 allows users to define the size of containers for the map and reduce tasks, jobs in a batch become heterogeneous and behave differently. Also, the different capacity of virtual machines in the MapReduce virtual cluster accommodate a varying number of map/reduce tasks. These factors highly affect resource utilization in the virtual cluster and the makespan for a batch of MapReduce jobs. Default MapReduce job schedulers do not consider these heterogeneities that exist in a cloud environment. Moreover, virtual machines in MapReduce virtual cluster process an equal number of blocks regardless of their capacity, which affects the makespan. Therefore, we devised a heuristic‐based MapReduce job scheduler that exploits virtual machine and MapReduce workload level heterogeneities to improve resource utilization and makespan. We proposed two methods to achieve this: (i) roulette wheel scheme based data block placement in heterogeneous virtual machines, and (ii) a constrained 2‐dimensional bin packing to place heterogeneous map/reduce tasks. We compared heuristic‐based MapReduce job scheduler against the classical fair scheduler in MapReduce v2. Experimental results showed that our proposed scheduler improved makespan and resource utilization by 45.6% and 47.9% over classical fair scheduler.  相似文献   

9.
    
Recent years have seen an increased interest in large-scale analytical data flows on non-relational data. These data flows are compiled into execution graphs scheduled on large compute clusters. In many novel application areas the predominant building blocks of such data flows are user-defined predicates or functions (Udfs). However, the heavy use of Udfs is not well taken into account for data flow optimization in current systems.Sofa is a novel and extensible optimizer for Udf-heavy data flows. It builds on a concise set of properties for describing the semantics of Map/Reduce-style Udfs and a small set of rewrite rules, which use these properties to find a much larger number of semantically equivalent plan rewrites than possible with traditional techniques. A salient feature of our approach is extensibility: we arrange user-defined operators and their properties into a subsumption hierarchy, which considerably eases integration and optimization of new operators. We evaluate Sofa on a selection of Udf-heavy data flows from different domains and compare its performance to three other algorithms for data flow optimization. Our experiments reveal that Sofa finds efficient plans, outperforming the best plans found by its competitors by a factor of up to six.  相似文献   

10.
本文分析了当前网络考试系统数据挖掘现状,介绍了云计算和数据挖掘的相关概念,指出传统数据挖掘技术在当今考试系统海量数据情况下挖掘时系统响应速度慢,负载不均衡和节点效率低的不足,设计了基于Map/Reduce并行编程模型的Apriori算法,利用云计算环境下计算资源来支持该算法的并行执行,通过实例说明云计算化后的Apriori算法在对海量考试数据进行挖掘时能获得更高的挖掘效率。  相似文献   

11.
传统的数据分析,很难满足现阶段大数据处理效率的要求.Hadoop云计算技术的应用,实现了海量数据存储和分析,提高了数据存储和分析的效率.在总结传统系统利弊的基础上,以Hadoop分布式文件系统(HDFS)取代现有的单机数据存储,以map/reduce应用程序取代传统的单机数据分析,并对其做出优化.实验证明,Hadoop系统架构在生产上部署、投入使用的可行性.  相似文献   

12.
    
Shift‐reduce parsing enjoys the property of efficiency because of the use of efficient parsing algorithms like greedy/deterministic search and beam search. In addition, shift‐reduce parsing is much simpler and easy to implement compared with other parsing algorithms. In this article, we explore constituent boundary information to improve the performance of shift‐reduce phrase‐structure parsing. In previous work, constituent boundary information has been used to speed up chart parsers successfully. However, whether it is useful for improving parsing accuracy has not been investigated. We propose two different models to capture constituent boundary information, based on which two sets of novel features are designed for a shift‐reduce parser. The first model is a boundary prediction model that uses a classifier to predict the boundaries of constituents. We use automatically parsed data to train the classifier. The second one is a Tree Likelihood Model that measures the validity of a constituent by its likelihood which is calculated on automatically parsed data. Experimental results show that our proposed method outperforms a strong baseline by 0.8% and 1.6% in F‐score on English and Chinese data, respectively, achieving the competitive parsing accuracies on Chinese (84.8%) and English (90.8%). To our knowledge, this is the first time for shift‐reduce phrase‐structure parsing to advance the state‐of‐the‐art with constituent boundary information.  相似文献   

13.
蔡键  王树梅 《数字社区&智能家居》2009,5(9):7093-7095,7107
先介绍了云计算产生的背景、概念、基本原理和体系结构,然后以Google系统为例详细阐述了云计算的实现机制。云计算是并行计算、分布式计算和网格计算等计算机科学概念的商业实现。Google拥有自己云计算平台,提供了云计算的实现机制和基础构架模式。该文阐述了Google云计算平台:GFS分布式文件、分布式数据库BigTable及Map/Reduce编程模式。最后分析了云计算发展所面临的挑战。  相似文献   

14.
上下文无关语言分析树的一种表示形式   总被引:5,自引:0,他引:5       下载免费PDF全文
介绍了上下文无关语言(CFL)的句子的一种分析树表示,它适用用于一类与以往不同的CFL的应用,即对分析树空间效率要求较高且不需标记分析树的应用,典型的就是把CFL的句子用作算法加工对象,这种表示比传统分析树不仅空间较小,而且进行结构匹配的快速快,还介绍了这种分析树表示的实现技术。  相似文献   

15.
The work presented here attempts to bring out some fundamental concepts that underlie some known parsing algorithms, usually called chart or dynamic programming parsers, in the hope of guiding the design of similar algorithms for other formalisms that could be considered for describing the "surface" syntax of languages. The key idea is that chart parsing is essentially equivalent to a simple construction of the intersection of the language (represented by its grammar) with a regular set containing only the input sentence to be parsed (represented by a finite state machine). The resulting grammar for that intersection is precisely what is usually called a shared forest: it represents all parses of a syntactically ambiguous sentence. Since most techniques for processing ill-formed input can be modeled by considering a nonsingleton regular set of input sentences, we can expect to generalize these ill-formed input processing techniques to all parsers describable with our approach.  相似文献   

16.
首先介绍了云计算产生的背景、概念、基本原理和体系结构,然后以Google系统为例详细阐述了云计算的实现机制。云计算是并行计算、分布式计算和网格计算等计算机科学概念的商业实现。Google拥有自己云计算平台,提供了云计算的实现机制和基础构架模式。该文阐述了Google云计算平台:GFS分布式文件、分布式数据库BigTable及Map/Reduce编程模式。最后分析了云计算发展所面临的挑战。  相似文献   

17.
煤矿安全巡检工作对保障煤矿安全生产至关重要.基于Android平台设计了一套用于煤矿安全巡检系统的客户端.介绍了系统组成及工作流程,重点阐述了设计中涉及的关键技术,如SAX解析、SQLite数据库、soeket通信等.实际应用表明,该客户端全面有效地推进了煤矿安全巡检工作的标准化、信息化,加大了媒矿安全生产的监控力度.  相似文献   

18.
We investigate the problem of channel assignment in a metropolitan multi-radio wireless mesh network with directional antennas. Our contributions include a new conflict graph model for capturing the interference between links in a mesh network with a known wireless interface communication graph, and a new channel assignment procedure which accounts for interference both between links inside the mesh network, and from external sources. Additionally, we have implemented and evaluated the proposed channel assignment procedure in an actual metropolitan mesh network with 1.6-5 km links. Key components of the channel assignment procedure are the interference model, the link ordering, and the channel selection metric. The experimental results demonstrate how link ordering and the channel selection metric affect performance, in terms of the average packet delay and http latency. The results show that the proposed channel assignment procedure achieves performance very close to a lower bound of the average packet delay, and significantly higher than the performance achieved with a simpler interference-unaware procedure, and a measurement-based scheme that has appeared in the literature, and accounts for interference only from external 802.11 sources. Moreover, we investigate the performance when a different number of channels are available, and the timescales for channel re-assignment.  相似文献   

19.
采用抗干扰能力比较强的FSK技术构成感应通信系统,利用耦合线圈来实现钻杆之间的无线通信,钻杆内部采用同轴电缆传输信息,这样可以获得较高的数据比特率。本文以AT89C51单片机为控制系统,设计了一套可以实现双向通信的FSK系统,并测试了该系统的可靠性以及误码率。  相似文献   

20.
证书解析是证书应用的基础,目前已知的证书解析操作均运行于操作系统应用层。这种证书解析方法尽管具有较强的通用性,但代码复杂,占用系统资源较多。本文在研究证书格式的基础上,给出了一种适用于操作系统内核层、嵌入式系统等资源受限环境的解析方法,具有实现简单、占用资源少、运行速度快等特点。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号