[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fj16FkAqGgKsvSclW9aHXW00m_Lp7E9Gc32SG5iSKaLI":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":30,"type":31},[],"2025-01-04 15:27:10",176211489,[8,9,10,11],"无限循环","回溯","非法调用","有限次调用",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},56,"7f9bb8a7a171927eb86d50a926a0cccb","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F34afe9e40aa191cab52c0b11067d9140.jpg","编译原理","exam_145887501","摸底测试","在递归子程序方法中,若文法存在左递归,则会使分析过程产生()",[21,32,41,50,53,62,72,81,90,99],{"answer":22,"createTime":5,"id":23,"options":24,"question":29,"source":30,"type":31},[],176211479,[25,26,27,28],"1型文法","0型语法","2型文法","3型文法","由"非终结符-->符号串"这种产生式构成的文法是()","v1",0,{"answer":33,"createTime":5,"id":34,"options":35,"question":40,"source":30,"type":31},[],176211482,[36,37,38,39],"语义分析","目标代码生成","词法分析","语法分析","在编译中产生语法树是为了()",{"answer":42,"createTime":5,"id":43,"options":44,"question":49,"source":30,"type":31},[],176211484,[45,46,47,48],"SLR(1)","LR(1)","LL(K)","算符优先法","下面哪种不是自底向上的语法分析文法( )",{"answer":51,"createTime":5,"id":6,"options":52,"question":19,"source":30,"type":31},[],[8,9,10,11],{"answer":54,"createTime":5,"id":55,"options":56,"question":61,"source":30,"type":31},[],176211492,[57,58,59,60],"\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fe73b7d9e1cf6e09b2b7bd8785ec42a45.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F0d6a895b3edbe4d19cd3bbb38b6fa80d.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F496f40037cfc316c3a32e294868e0b6a.png\">","\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Ff5943943ef8c5c034bd5ed17bd0e70b9.png\">","下图所示为一个不确定有限自动机(NFA)的状态装换图.该NFA识别的字符串集合可用正规式( )描述. \u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F99903b1f1b88dfb7298345df77e5efd1.png\">",{"answer":63,"createTime":64,"id":65,"options":66,"question":71,"source":30,"type":31},[],"2025-01-04 15:27:11",176211495,[67,68,69,70],"a+b\u002Fc+d","a+b+c\u002Fd","a+b\u002F(c+d)","(a+b)\u002F(c+d)","后缀式 ab+cd+\u002F可用表达式( )来表示",{"answer":73,"createTime":64,"id":74,"options":75,"question":80,"source":30,"type":31},[],176211499,[76,77,78,79],"自底向上","自顶向下","自右向左","自左向右","递归下降子程序法属于( )语法分析方法",{"answer":82,"createTime":64,"id":83,"options":84,"question":89,"source":30,"type":31},[],176211502,[85,86,87,88],"自底向上分析法","自顶向下分析法","LALR分析法","SLR分析法","LR分析法属于( )",{"answer":91,"createTime":64,"id":92,"options":93,"question":98,"source":30,"type":31},[],176211505,[94,95,96,97],"a-bc*\u002Fcd-b-a*+-","a-bc*cd-b-a*+\u002F-","a-bc*cd-\u002Fb-a*+-","abc*cd-b-a*+\u002F--","表达式-a-(b*c\u002F(c-d)+(-b)*a)的后缀表示是()",{"answer":100,"createTime":64,"id":101,"options":102,"question":107,"source":30,"type":31},[],176211508,[103,104,105,106],"6","9","5","4","设定义在字母表{ a,b,c ,x,y}上的正规式r = (a|b|c)(x|y),则L(r)中元素有( )个"]