3 Star 5 Fork 3

solider12/懒猫的代码仓库

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
parseStack.h 1.42 KB
一键复制 编辑 原始数据 按行查看 历史
/*******************************************************************
Copyright (c) [2023] [s]
[dbassist] is licensed under Mulan PSL v2.
You can use this software according to the terms and conditions of the Mulan PSL v2.
You may obtain a copy of Mulan PSL v2 at:
http://license.coscl.org.cn/MulanPSL2
THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
See the Mulan PSL v2 for more details.
*******************************************************************/
#pragma once
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "stack.h"
#define Max_Index_Size 512
typedef enum indexType{
Numerics,
Brackets,
Braceses,
DouQuots
}indexType;
typedef struct indexNode
{
int nLIndex;
int nRIndex;
indexType type;
}indexNode;
typedef struct indexList
{
indexNode* array[Max_Index_Size];
int length;
indexType type;
char lchar;
char rchar;
}indexList;
indexList* createIndexList(indexType type);
void addMember(indexList* L,indexNode* p);
indexNode* createIndexNode(int nLIndex,int nRIndex,indexType type);
void showIndexList(indexList* L);
void sortList(indexList* L);
int BracketMatch(char *x,indexList* L);
void NumberMatch(char* x,indexList* L);
int getnLIndex(int n,indexList* L);
int getnRIndex(int n,indexList* L);
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C
1
https://gitee.com/solider12/lazy-cats-code-warehouse.git
git@gitee.com:solider12/lazy-cats-code-warehouse.git
solider12
lazy-cats-code-warehouse
懒猫的代码仓库
master

搜索帮助