Location:
Search - 括号匹配
Search list
Description: VC 括号匹配 问题-VC matching brackets
Platform: |
Size: 4687 |
Author: 海应 |
Hits:
Description: 栈的应用（2）括号匹配检查-stack of applications (2) matching brackets inspection
Platform: |
Size: 5521 |
Author: 哈哈 |
Hits:
Description: 用MFC可视化编程，实现括号匹配，大括号，中括号，小括号都可以进行匹配
Platform: |
Size: 1886549 |
Author: yiyezhangdaqq |
Hits:
Description: 文本括号匹配
Platform: |
Size: 3781 |
Author: uiky_dear |
Hits:
Description: 这是求括号匹配的程序-This is the bracketed match for the procedure
Platform: |
Size: 1024 |
Author: zwq0302317 |
Hits:
Description: 判断括号是否匹配-judge whether matching brackets
Platform: |
Size: 1024 |
Author: 杨东海 |
Hits:
Description: VC 括号匹配 问题-VC matching brackets
Platform: |
Size: 4096 |
Author: 海应 |
Hits:
Description: 栈的应用（2）括号匹配检查-stack of applications (2) matching brackets inspection
Platform: |
Size: 5120 |
Author: 哈哈 |
Hits:
Description: « 问题描述：在对高级语言编写的程序进行编译时会遇到表达式或字符串的括号匹配问题。例如C++程序中左、右花括号“{”和“}”的匹配问题。表达式（字符串）的括号匹配问题要求确定一给定表达式（字符串）中左、右括号的匹配情况。例如，表达式(x*(x+y)-z)在位置1 和4处有左括号，在位置8 和11 处有右括号。位置1 处的左括号与位置11 处的右括号相匹配；位置4 处的左括号与位置8 处的右括号相匹配。而在表达式(x+y)*z)(中，位置8处的右括号没有可匹配的左括号，位置9处的左括号没有可匹配的右括号。« 编程任务：给定一个C++源程序，编程计算其中括号“<”和“>”；“(”和“)”；“[”和“]”；“{”和“}”的匹配情况-laquo; Problem description : In preparation for the high-level language compiler procedures that will be encountered expression or string matching brackets. C procedures such as left and right curly "(" and ")" matching problem. Expression (string), the brackets matching requirement to set a fixed expression (string) left and right brackets of the match. For example, the expression (x* (x y)- z) in a position and have left four brackets in position 8 and 11 have the right brackets. A position on the left with brackets of 11 positions in brackets right match; Location four brackets on the left and the location of eight brackets right match. The expression (x y)* z) (location eight brackets on the right side can not match left in brackets, location nine left in bracket
Platform: |
Size: 1024 |
Author: 林天 |
Hits:
Description: 用C做的括号匹配程序,可以检测用户输入的括号是否匹配并给出提示-C matching brackets do procedures, the user can input the brackets and whether the match is suggested
Platform: |
Size: 1024 |
Author: 阿姆罗 |
Hits:
Description: 括号匹配算法 数据结构
用c＋＋或c都实现的-brackets matching algorithm data structure with c++ or c realize the
Platform: |
Size: 1024 |
Author: 尹川 |
Hits:
Description: 数据结构中堆栈与队列的应用的练习程序，包括1.用数组的形式实现顺序栈的定义和操作 2.利用堆栈将队列中的元素逆置 3.括号匹配算法 包括调试报告和实验报告 程序源代码在实验报告当中
-stack data structures and the application of Queue practice procedures, including one. using arrays in the form of the definition of the order stack and operating two. Queue will use stack of three elements of inverse home. brackets matching algorithm including a debugger and pilot reports the source code in experimental reports of
Platform: |
Size: 859136 |
Author: 张焕人 |
Hits:
Description: 括号匹配，栈应用的小程序，希望对大家有所帮助-matching brackets, the small stack application procedures, we hope to help
Platform: |
Size: 9216 |
Author: 味精 |
Hits:
Description: 自己写的C＋＋栈模板，并用其实现了括号匹配算法-write their own C++ Stack template, and used to achieve the brackets Matching Algorithm
Platform: |
Size: 291840 |
Author: 张帆 |
Hits:
Description: 1.检测程序中的括号是否匹配
把光标移动到需要检测的括号(如大括号{}、方括号[]、圆括号()和尖括号<>)前面，键入快捷键“Ctrl＋]”。如果括号匹配正确，光标就跳到匹配的括号处，否则光标不移动，并且机箱喇叭还会发出一声警告声。
2.查看一个宏(或变量、函数)的宏定义
把光标移动到你想知道的一个宏-1. Check whether the matching brackets moving cursor to the need to detect brackets (e.g. () brackets. square brackets [], parentheses () and Tsim brackets
Platform: |
Size: 3072 |
Author: 林两 |
Hits:
Description: 数据结构
1、算法思路：
假设表达式中包含两种括号：圆括号和方括号，其嵌套顺序随意，即([]())或[([])]等为正确的格式，[(])或([())或(()]均为不正确的格式。检验括号是否匹配可以用堆栈来实现当遇到 ( 或 [ 时进栈，遇到 ) 或 ] 时出栈进行匹配检验，如果出现不匹配的情况立即结束，否则继续取下一个字符。如果没有遇到不匹配的情况，最后判断栈是否为空，栈为空，括号匹配,否则不匹配。
-Data Structure 1, Algorithm idea: the assumption that the expression contains two types of brackets: parentheses and brackets, the nested sequence of random, that is, or ([]()) [([])] such as the correct format, [( ]) or ([()) or (()] are not the correct format. test match brackets can be used to achieve when the stack (or [into the stack when encountered) or] when a stack test match , if the situation does not match an immediate end to, or continue to remove a character. If you do not encounter the situation does not match, the last to judge whether the stack is empty, the stack is empty, parentheses matching, otherwise do not match.
Platform: |
Size: 13312 |
Author: Anson |
Hits:
Description: 编写一个程序：来检测程序中的简单语法错误。例如：不配对的圆括号、方括号和花括号。并注意单引号、双引号和注释段的处理。
计算模型
本程序主要功能“括号匹配”的计算模型为：
1:清空堆栈
2:从左到右查表达式的每一个左括号
3:如为左括号,将此左括号压进堆栈
4:如为右括号,查堆栈是否空?为空说明右括号数目>左括号指示出错。
5:如果非空,从堆栈中取但不弹出一个左括号来,查它是否与此右括号类型匹配,不匹配,就指示出错。匹配，就将此括号弹出堆栈。
6:重复2-5,如能直到最后一个符号不出错,则表示完全匹配,结束. -err
Platform: |
Size: 145408 |
Author: miao |
Hits:
Description: 实现文本格式文件中的括号匹配.
匹配算法采用堆栈来实现.
文件读取异常还需完善的人性化一些-Text format documents matching brackets. Matching algorithm uses the stack to achieve. Paper anomaly needs to be well-read human nature of some `` ``
Platform: |
Size: 2048 |
Author: lee |
Hits:
Description: 实现括号匹配问题,我们经常遇到输入括号，却不知道括号是否搭配正确的问题，通过本程序可以实现自动检测括号是否匹配的问题(To achieve parentheses matching problem, we often encounter input brackets, but do not know whether brackets correct collocation problem, through this program can automatically detect brackets matching problem)
Platform: |
Size: 975872 |
Author: sujun
|
Hits:
Description: 检验一条信息中括号各个匹配与否。比如输入（）{}会提示错误，输入（{}）会提示正确。 另外附录了线性表基本操作的对应代码(Check whether parentheses match each other in a message. In addition, the corresponding code of the basic operation of the linear table is attached)
Platform: |
Size: 1024 |
Author: 夜小路
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
19
»