简单的题,解析见注释
#include<iostream>
#include<vector>
#include<string>
#include<type_traits>
#include<sstream>
#include<tuple>
#include<bitset>
#include<regex>
#include<set>
#include<stack>
#include<queue>
#include<map>
using namespace std;
typedef struct{//定义的数据结构,存储数组的信息
string name;//存储数组的名称
int length;//存储数组的长度
map<int,int> data;//存储数组中有哪些元素已经初始化,并且存储对应位置的元素值
}arr;
int explore(string s,int& start, map<string, int>& str2in,vector<arr>& vc,bool flag,int store){
if (s[0] >= '0'&&s[0] <= '9'){//如果目前解析的是常数,则直接计算出来,并且存入到start中
start = 0;
int i = 0;
while (i < s.size()){
start = start * 10 + (s[i]-'0');
i++;
}
return 0;//number
}
string name = "";
stack<string> Name;
start = 0;
for (int i = 0; i < s.size(); i++){//逐层解析,利用栈,便于后面将后解析到的数组名先处理
if (s[i] != '['){
if (s[i] >= '0'&&s[i] <= '9'){
while (i < s.size()&&s[i]!=']'){
start = start * 10 + (s[i]-'0');
i++;
}
break;
}
else{
name += s[i];
}
}
else if(s[i]=='['){
if (str2in.find(name) == str2in.end()) return -1;
Name.push(name);
name = "";
}
}
while (!Name.empty()){//依次处理堆栈中的数组名
string deal = Name.top();
Name.pop();
int index = str2in[deal];
arr& demo = vc[index];
if (demo.length <= start) return -1;
else if (flag == false && demo.data.find(start) == demo.data.end()) return -1;
else{
if (Name.empty() && flag) demo.data[start] = store;
start = demo.data[start];
}
}
return 1;
}
int main(){
string s;
while (true){
queue<string> q;
while (getline(cin, s)){//对待测程序进行读入
if (s == ".") break;
q.push(s);
}
int length = q.size();
if (q.empty()) break;
vector<arr> vc;//vc存储每一个数组的信息
map<string, int> str2in;//str2in建立数组名到vc中相应下标的映射
int error;
int cur_pos = 1;//cur_pos记录当前处理的程序的行数
while (!q.empty()){
string s = q.front();//每次处理一行代码
q.pop();
int index = s.find("=");
if (index == -1){//如果没有等于号,则当前的指令是对数组进行定义
arr arr_t;
arr_t.name = "";
int i;
for (i = 0; i < s.size(); i++){//读取数组的名字
if (s[i] != '['){
arr_t.name += s[i];
}
else{
break;
}
}
i++;
int num = 0;
while (i < s.size()){//读取数组的长度
num = num * 10 + (s[i]-'0');
i++;
if (s[i] == ']') break;
}
arr_t.length = num;
vc.push_back(arr_t);
str2in[arr_t.name] = vc.size() - 1;
}
else{//如果当前存在等于号,那么当前的指令是赋值操作
string sub1 = s.substr(0,index);
string sub2 = s.substr(index + 1);
int start;
bool flag = false;//flag为false,代表着解析等于号右边的信息
int store=-1;
int res = explore(sub2, start, str2in, vc, flag, store);//解析等于号右边的信息
if (res == -1){
cout << cur_pos << endl;
break;
}
else{
store = start;//start代表着解析等号右边所得到的结果
flag = true;
res = explore(sub1, start, str2in, vc, flag, store);//继续解析左边,如果左边解析成功,则存入右边解析得到的值,便于后续的判断
if (res == -1){
cout << cur_pos << endl;
break;
}
}
}
cur_pos++;
}
if (cur_pos == (length+1)){
cout << "0" << endl;
}
}
//system("pause");
return 0;
}