2000 年上海华东师范大学编译原理考研真题
一.LEX 和 YACC 是 UNIX 操作系统中的二个软件工具,试简要叙述它们的功能及其相互关系。
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
二.试消除下述传递图的ε弧,并将它变换成等价的确定的有限状态自动机的状态图。
三.考察文法 G[]∶
-3| c
->ab ! b
->ac| E
试问∶ G[]是 LL(1)文法吗?
G[]是 LR(0),SLR(1),LALR(1)或 LR(1)文法吗?
为什么?
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
1.已知递增有序的两个单链表 A、B 分别存储了一个集合,写一函数实现求两个集合的并
集的运算 A=AUB。(10 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
2.已知一组数 31,59,45,48,88。
(1)以这组数作结点值,画出由这些结点组成的一棵查找树和相应的中序穿线树。(8 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
(2)以这组数分别作五个结点的权值,画出一棵 Huffman 树。(8 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
3.一有向图如下∶
(1)求顶点 1 到其它顶点的最短路径长度,要求写出计算过程。(8 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
(2)去掉边上的权值,求此图的一个拓扑序列。(6 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________
4. 写一函数求出图的强连通分量。(10 分)
_______________________________________________________________________________
_______________________________________________________________________________
_______________________________________________________________________________
_____________________________________________