栈的应用研究  

Application and Research on Stack

作　　者：魏少涵[1,2] 

机构地区：[1]福建工程学院国脉信息学院计算机与信息科学系,福州350014 [2]福州理工学院信息工程系,福州350506

出　　处：《现代计算机》2015年第24期17-20,共4页Modern Computer

摘　　要：栈是一种重要的操作受限的线性表,在计算机内可以用顺序存储或链式存储来实现。基于其后进先出特性,应用非常广泛,例如进制转换、表达式求值,括号匹配,消除递归等。在总结其应用的同时,对于一些栈的应用给出算法描述。其中,表达式求值问题给出了针对不同表达式的两种不同算法。Stack is one of the important linear lists which is limited in operations. It can be realized by sequential storage and dynamic storage by link. It is used in many problems based on its last in first out property. For example, conversion of number system, evaluation of expression, brace match, recursion elimination and so on. Some algorithms are listed. Based on different kinds of expression, two algorithms have been given out.

关 键 词：栈 表达式求值 递归 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]