登录
首页 » Visual C++ » expression

expression

于 2011-10-30 发布 文件大小:419KB
0 243
下载积分: 1 下载次数: 7

代码说明:

  利用栈完成算术表达式求值:从键盘或文件中输入算术表达式,计算其结果并显示。要求处理过程为:(1)转换为后缀表达式并输出;(2)对后缀表达式求值并输出。 输入的表达式中可以有整数、实数、括号,运算符包括+、-、*、/、#(代表单目负)。可以多次输入不同的表达式进行计算,直到用户选择“退出”。栈的基本操作可以自己实现,也可以使用系统提供的STL实现。 (Done using an arithmetic expression evaluation stack: file input from the keyboard or an arithmetic expression, calculate and display the results. Requirements process: (1) to postfix expression and output (2) evaluation of the postfix expression and output. Enter the expression can be integers, real numbers, parentheses, operators including+,-,*,/,#( representatives unary minus). You can enter several different expressions are evaluated until the user selects " Exit." Stack can implement the basic operations, you can also use the system implementation of the STL.)

文件列表:

expression
..........\Epression覆盖率报告
..........\...................\amber.png
..........\...................\bits
..........\...................\....\allocator.h.func-sort-c.html,3821,2011-10-19
..........\...................\....\allocator.h.func.html,3828,2011-10-19
..........\...................\....\allocator.h.gcov.html,23750,2011-10-19
..........\...................\....\basic_ios.h.func-sort-c.html,5283,2011-10-19
..........\...................\....\basic_ios.h.func.html,5290,2011-10-19
..........\...................\....\basic_ios.h.gcov.html,52525,2011-10-19
..........\...................\....\basic_string.h.func-sort-c.html,7104,2011-10-19
..........\...................\....\basic_string.h.func.html,7111,2011-10-19
..........\...................\....\basic_string.h.gcov.html,322852,2011-10-19
..........\...................\....\char_traits.h.func-sort-c.html,3716,2011-10-19
..........\...................\....\char_traits.h.func.html,3723,2011-10-19
..........\...................\....\char_traits.h.gcov.html,60298,2011-10-19
..........\...................\....\index-sort-b.html,7983,2011-10-19
..........\...................\....\index-sort-f.html,7983,2011-10-19
..........\...................\....\index-sort-l.html,7983,2011-10-19
..........\...................\....\index.html,7990,2011-10-19
..........\...................\....\ios_base.h.func-sort-c.html,3851,2011-10-19
..........\...................\....\ios_base.h.func.html,3858,2011-10-19
..........\...................\....\ios_base.h.gcov.html,100087,2011-10-19
..........\...................\....\locale_facets.h.func-sort-c.html,3530,2011-10-19
..........\...................\....\locale_facets.h.func.html,3537,2011-10-19
..........\...................\....\locale_facets.h.gcov.html,277401,2011-10-19
..........\...................\....\stl_algobase.h.func-sort-c.html,3523,2011-10-19
..........\...................\....\stl_algobase.h.func.html,3530,2011-10-19
..........\...................\....\stl_algobase.h.gcov.html,134719,2011-10-19
..........\...................\emerald.png
..........\...................\ext
..........\...................\...\atomicity.h.func-sort-c.html,3914,2011-10-19
..........\...................\...\atomicity.h.func.html,3921,2011-10-19
..........\...................\...\atomicity.h.gcov.html,14817,2011-10-19
..........\...................\...\index-sort-b.html,4964,2011-10-19
..........\...................\...\index-sort-f.html,4964,2011-10-19
..........\...................\...\index-sort-l.html,4964,2011-10-19
..........\...................\...\index.html,4971,2011-10-19
..........\...................\...\new_allocator.h.func-sort-c.html,3915,2011-10-19
..........\...................\...\new_allocator.h.func.html,3922,2011-10-19
..........\...................\...\new_allocator.h.gcov.html,16151,2011-10-19
..........\...................\gcov.css,9893,2011-10-19
..........\...................\glass.png
..........\...................\home
..........\...................\....\swmore
..........\...................\....\......\AList.cpp.func-sort-c.html,5093,2011-10-19
..........\...................\....\......\AList.cpp.func.html,5100,2011-10-19
..........\...................\....\......\AList.cpp.gcov.html,3222,2011-10-19
..........\...................\....\......\AStack.h.func-sort-c.html,5393,2011-10-19
..........\...................\....\......\AStack.h.func.html,5400,2011-10-19
..........\...................\....\......\AStack.h.gcov.html,8230,2011-10-19
..........\...................\....\......\CityInformation.cpp.func-sort-c.html,3966,2011-10-19
..........\...................\....\......\CityInformation.cpp.func.html,3973,2011-10-19
..........\...................\....\......\CityInformation.cpp.gcov.html,3249,2011-10-19
..........\...................\....\......\CityInformation.h.func-sort-c.html,3908,2011-10-19
..........\...................\....\......\CityInformation.h.func.html,3915,2011-10-19
..........\...................\....\......\CityInformation.h.gcov.html,3238,2011-10-19
..........\...................\....\......\Expression.cpp.func-sort-c.html,4881,2011-10-19
..........\...................\....\......\Expression.cpp.func.html,4888,2011-10-19
..........\...................\....\......\Expression.cpp.gcov.html,59371,2011-10-19
..........\...................\....\......\Expression.h.func-sort-c.html,3555,2011-10-19
..........\...................\....\......\Expression.h.func.html,3562,2011-10-19
..........\...................\....\......\Expression.h.gcov.html,9550,2011-10-19
..........\...................\....\......\expressionMain.cpp.func-sort-c.html,3948,2011-10-19
..........\...................\....\......\expressionMain.cpp.func.html,3955,2011-10-19
..........\...................\....\......\expressionMain.cpp.gcov.html,15261,2011-10-19
..........\...................\....\......\index-sort-b.html,10482,2011-10-19
..........\...................\....\......\index-sort-f.html,10482,2011-10-19
..........\...................\....\......\index-sort-l.html,10482,2011-10-19
..........\...................\....\......\index.html,10489,2011-10-19
..........\...................\....\......\LList.cpp.func-sort-c.html,5102,2011-10-19
..........\...................\....\......\LList.cpp.func.html,5109,2011-10-19
..........\...................\....\......\LList.cpp.gcov.html,3223,2011-10-19
..........\...................\....\......\LList.h.func-sort-c.html,3516,2011-10-19
..........\...................\....\......\LList.h.func.html,3523,2011-10-19
..........\...................\....\......\LList.h.gcov.html,3208,2011-10-19
..........\...................\....\......\main.cpp.func-sort-c.html,4206,2011-10-19
..........\...................\....\......\main.cpp.func.html,4213,2011-10-19
..........\...................\....\......\main.cpp.gcov.html,3223,2011-10-19
..........\...................\....\......\project
..........\...................\....\......\.......\AList.h.func-sort-c.html,7723,2011-10-19
..........\...................\....\......\.......\AList.h.func.html,7730,2011-10-19
..........\...................\....\......\.......\AList.h.gcov.html,3253,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.func-sort-c.html,4548,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.func.html,4555,2011-10-19
..........\...................\....\......\.......\cityDatabase.cpp.gcov.html,3281,2011-10-19
..........\...................\....\......\.......\index-sort-b.html,5781,2011-10-19
..........\...................\....\......\.......\index-sort-f.html,5781,2011-10-19
..........\...................\....\......\.......\index-sort-l.html,5781,2011-10-19
..........\...................\....\......\.......\index.html,5788,2011-10-19
..........\...................\....\......\.......\List.h.func-sort-c.html,3562,2011-10-19
..........\...................\....\......\.......\List.h.func.html,3569,2011-10-19
..........\...................\....\......\.......\List.h.gcov.html,3239,2011-10-19
..........\...................\....\......\Stack.h.func-sort-c.html,3682,2011-10-19
..........\...................\....\......\Stack.h.func.html,3689,2011-10-19
..........\...................\....\......\Stack.h.gcov.html,5175,2011-10-19
..........\...................\i686-linux-gnu
..........\...................\..............\bits
..........\...................\..............\....\gthr-default.h.func-sort-c.html,3576,2011-10-19
..........\...................\..............\....\gthr-default.h.func.html,3583,2011-10-19

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • hash
    使用全排列实现hash,看看吧相信对大家会有些帮助的(Full array hash)
    2011-08-19 21:25:34下载
    积分:1
  • xuanzexingjiegou
    选择型结构c语言编程 (Choose the type of structure of C language programming)
    2013-09-24 22:11:37下载
    积分:1
  • polynomial
    本程序实现一元多项式合并。本程序输入方式为按项输入,每输入一个项,会先提示输入项的幂,再提示输入项的系数。(This procedure combined to achieve a dollar polynomial. This procedure according to entry input methods for the input, one for each input item, it will first prompt entry of the power, and then prompts entry of the coefficient.)
    2009-12-16 17:29:54下载
    积分:1
  • pinfanfangwen
    设有一头指针为L的带有表头结点的非循环双向链表,其每个结点中除有prev(前驱指针),data(数据)和next(后继指针)域外,还有一个访问频度域freq。在链表被起用前,其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时,令元素值为x的结点中freq域的值增1,并使此链表中结点保持按访问频度非增(递减)的顺序排列,同时最近访问的结点排在频度相同的结点的最后,以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法,该运算为函数过程,返回找到结点的地址,类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)
    2015-01-15 22:31:59下载
    积分:1
  • Josephus(data_struct)
    数据结构中基于约瑟夫环问题,用C++方式实现的。。。。。(Data structure based on Josephus problem with C++ a manner. . . . .)
    2013-11-17 11:30:24下载
    积分:1
  • X_bit0mintest
    X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)
    2011-07-02 21:37:01下载
    积分:1
  • test
    使用vc编写的一个动态链接库,测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)
    2010-05-28 23:27:09下载
    积分:1
  • migong
    简单的迷宫问题,有点土,还望大家多指点指点,在此感激不尽。(????? mad spasm, ? Tang Gao, ? oligonucleotide ??? Ning Ning ? ?, Hitomi ?????.)
    2008-07-05 00:11:37下载
    积分:1
  • select
    采用Dijkstra算法和Floyd算法实现的简单医院选址系统(data structure)
    2009-03-11 20:23:09下载
    积分:1
  • paixu
    各种排序算法的实现,如快速排序,冒泡排序,选择排序,堆排序,二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)
    2010-09-28 22:20:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载