搜索资源列表
delimiter_matching
- 编写简易编译器,能发现分隔符匹配的错误如括号、注释符的匹配问题,都能检测出来-delimiter matching The simple algorithm uses a stack and is as follows: Make an empty stack. Read characters until end of file. If the character is an open anything, push it onto the stack. If it is a close
ctixian20040130
- 介绍一下这个程序的功能: 1,提醒功能。有约会提醒,记念日提醒,每日定时提醒,每周定提醒。 2,定时器。设定小时数,倒数时间,到0时弹出窗口提醒。 3,秒表。 4,日期计算。计算两个日期之间的天数,计算多少天后是几号。 5,倒计时。记录一个重要的日期,倒数天数。 6,当前日期。显示当前日期,计算这周是从某天开始的第几周。 (非原创)-Explain the function of this procedure: 1, to remind function. Have an appointmen
binary-tree-in-templates
- so i want to make a code, that creates a binary tree, that holds data, for example ints like 1,6,2,10,8 and on pop i get the biggest number, and after that it gets deleted from the tree, and on push i can insert a new element. And this should be in a
new1
- about stacks, pop and pushes tells if stack is fu-about stacks, pop and pushes tells if stack is full