用实验方法改革汇编语言程序设计的教学

我们在多门计算机课程的教学实践中,摸索出一套"把实验实践环节与理论教学相融合,抓实验实践教学促进学科理论知识学习"的教学方法,有效地提高了学生的学习兴趣和课程的教学效果。实践证明,这样的教学方法符合"实践、认识、再实践、再认识"的辩证唯物主义认识论。本文从我国大众化高等教育的实际出发,从汇编语言及其教学现状、教学内容的分层次设计、把实验作为课程的主要教学手段以及实验教学改革与创新的成果等诸方面介绍了笔者对"汇编语言程序设计"课程的教改思路和实验创新成果。     

汇编程序的调试利器

汇编语言对工业控制计算机是非常重要的,本讨论了一个汇编语言的调试宏,在调试汇编语言程序时用之可提高效率。     

用Assembly汇编语言编写Windows程序

详细阐述了应用汇编语言在Ｗｉｎｄｏｗｓ下的编程技巧，论述了汇编语言调用ＳＤＫ的接口方式，提出了汇编语言的编程规范和应注意的事项。     

ARM汇编程序设计教学的研究

本文从目前"ARM汇编语言程序设计"课程教学中存在的问题入手,从教学内容、教学方法、教学手段,实验教学等几个方面讨论了提高课程教学质量的思路与策略。     

如何用汇编语言编写Windows应用程序

如今Windows越来越受到大家的喜欢,通常人们都喜欢用C、C~( )、Visual BASIC等语言开发Windows应用程序。但有时,由于一些特殊需要,还希望用汇编语言来开发Windows应用程序,比如一些涉及低级操作的驱动程序。只是目前关于用汇编语言开发Windows应用程序的参考资料比较少,而且即便是有,也只是泛泛而谈。所以大家在实际接触     

Windows环境下的汇编语言程序设计

一、引言 通常的汇编语言程序设计是在DOS环境下进行,但是现在Windows操作系统才是主流操作系统,对于Windows应用程序执行机制分析、病毒清除、设备驱动程序的编写等都需要使用汇编语言直接编写Win32应用程序,Win32应用程序的执行机制与以前的DOS平台下汇编语言程序有较大的差别,例如增加了消息循环,动态链接等.     

基于TMS320C2xx DSP芯片的常用函数程序设计方法

介绍了TMS320C2xx定点DSP芯片的软件编译和链接方法,详细讨论了用TMS320C2xx汇编语言计算倒数、开平方函数及指数函数的方法,并给出了汇编语言子程序清单。     

汇编语言程序设计系列讲座（一）

本系列讲座的目的是帮助读者学习汇编语言程序设计,达到入门和提高。讲座共分四讲:第一讲 介绍一个完整的源程序及其运行;第二讲 分支、循环及子程序设计举例;第三讲 汇编语言程序的调试;第四讲 汇编语言程序举例。每讲前,介绍该讲的主要内容,突出一个重点。每讲后给出要求,指出读者应掌握的知识。讲座汇集了经验,解答了学习汇编语言经常遇到的一些问题。讲座通过展示实例,通俗讲解汇编语言程序设计的方法和技巧。     

汇编与C语言混合程序设计方法研究

汇编语言直接面向机器,具有体积小、运行效率高、可直接控制硬件等特点,但是其编写和调试难度相对较大,C语言具有开发效率高、功能丰富、实用灵活等特点,但是无法实现对机器的直接控制,运行效率方面受到了一定的影响.针对汇编语言和C语言的独特优势,讨论基于汇编语言和C语言的混合程序设计方法,充分挖掘两种语言的优势,提高程序运行效率,希望能够为相关研究工作提供一定的参考.     

利用汇编语言深入编程

对汇编语言的变量使用，寄存器功能，过程定义等问题进行了深入探讨，有助于用汇编语言深入编程和对高级语言有关概念的理解。     

Wcrl: A data model independent language for database systems

The need for data model independent languages for database systems has become apparent in recent years. They can be used for the conceptual level of a database system, for communication in a distributed database system, for data restructuring, and so on. This paper proposes a language,wcrl, to fill this need and compares it with the very few other languages which have been developed almost concurrently to fill the same need.     

ALL——算法与数据结构教学小语言

Based on the idea of domain-specific languages,a little language--ALL ts proposed as a response to some problems in teaching “Algorithms and Data Structures” . We expect that ALL will help decouple the learning of algorithms and data structures from the learning of programming languages. The definition and implementation of the main elements of ALL are introduced in this paper.     

基于XML的半结构数据查询语言研究

半结构数据管理的核心问题之一是数据的有效查询问题。文章重点分析、比较了两种基于XML的半结构查询语言,即XQL和XML-QL。在此基础上总结出了XML查询语言的基本需求,并对目前的XML查询语言提出了四点扩充建议。     

有向图语言

经典形式语言有两条主线,就是自动机线索与形式文法线索。利用有向图理论和有向图半群理论建立了另一条线索——有向图语言,讨论了两类特殊的有向图语言——de Bruijn有向图语言和Kautz有向图语言,引入了连通语言及语言的直径等概念,计算出了de Bruijn有向图语言和Kautz有向图语言的直径。     

A program design language based software maintenance tool

Program design languages are an increasingly important method of expressing the detailed design of a software system. Such languages can be modelled using a data structure known as a semantic net. This paper describes a maintenance tool for program design languages based on such a data structure. The tool allows the user to interrogate a semantic net using an interactive procedural language in order to derive information necessary for software maintenance. The technique upon which this tool is based is applicable to the maintenance of activities throughout the software lifecycle.     

Declarative XML Update Language Based on a Higher Data Model

With the extensive use of XML in applications over the Web, how to update XML data is becoming an important issue because the role of XML has expanded beyond traditional applications in which XML is used for information exchange and data representation over the Web. So far, several languages have been proposed for updating XML data, but they are all based on lower, so-called graph-based or tree-based data models. Update requests are thus expressed in a nonintuitive and unnatural way and update statements are too complicated to comprehend. This paper presents a novel declarative XML update language which is an extension of the XML-RL query language. Compared with other existing XML update languages, it has the following features. First, it is the only XML data manipulation language based on a higher data model. Second, this language can express complex update requests at multiple levels in a hierarchy in a simple and flat way. Third, this language directly supports the functionality of updating complex objects while all other update languages do not support these operations. Lastly, most of existing languages use rename to modify attribute and element names, which is a different way from updates on value. The proposed language modifies tag names, values, and objects in a unified way by the introduction of three kinds of logical binding variables: object variables, value variables, and name variables.     

语言附着的句法结构

本文研究语言Ｌ的附着Ａｄｈ（Ｌ）的句法结构，借助于Ｌ的语法分析树，我们分析了Ａｄｈ（Ｌ）的句法特征，提出并证明了正规语言和上下文无关语言附着的叠代定理，从而解决了这两类语言的附着的句法结构问题。另外，应用引理证明了某些附着不是正规语言的附着或上下文无关语言的附着。     

Fixpoint and While Temporal Query Languages

The article investigates the expressive power of implicit temporalquery languages. These languages are designed while assumingtemporal data modelled as sequences of data. So far, two stylesof implicit temporal query languages are known: T-WHILE likelanguages are based on a temporal extension of WHILE with leftand right moves; µTL like languages are a fixpoint extensionof TL. This article focusses on comparing the expressive powerof T-WHILE style languages and µTL languages and providescomplementary results with respect to Abiteboul et al. (1999,J. Comput. System Sci.,58, 54–68). The main contributionis the proof of the equivalence of the three following temporallanguages: the non-inflationary variant of µTL, the languageT-WHILE and more surprisingly the language T-FIXPOINT.     

基于编程语言结构的通用配置代码生成方法

设计一种可以生成不同编程语言配置代码的通用生成装置。提出一种基于编程语言结构的用户描述规范,用户使用简单的语法编写一个按照该规范描述目标代码数据结构的模块即可生成相应的可配置代码,并能生成多种编程语言的可配置代码文件。该装置可以方便地移植到各种开发语言环境的软件或硬件系统中,减少软件或硬件代码配置工作的开发工作量和开发时间。     

Sub-classes of the monoid of left cancellative languages

A language A is left cancellative if from AB=AC, it follows that B=C, for any two languages B and C. Semi-singular and inf-singular languages are two disjoint sub-sets of left cancellative languages and are introduced by Hsieh and Shyr [Left cancellative elements in the monoid of languages, Soochow J. Math. 4 (1978), pp. 7–15]. In this paper, we further study them. It is shown that all non-dense and all maximal left cancellative languages are semi-singular while all right dense left cancellative languages are inf-singular. Finally, a theorem shows that there is a left cancellative language which is neither semi-singular nor inf-singular.