[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fVsZtCFAH4hZ7qQkPs6soTZlOMbko3AemPGgJeQCqL9Q":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":31,"type":32},[],"2025-01-04 15:27:11",176211508,[8,9,10,11],"6","9","5","4",{"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","摸底测试","设定义在字母表{ a,b,c ,x,y}上的正规式r = (a|b|c)(x|y),则L(r)中元素有( )个",[21,33,42,51,60,69,78,87,96,105],{"answer":22,"createTime":23,"id":24,"options":25,"question":30,"source":31,"type":32},[],"2025-01-04 15:27:10",176211479,[26,27,28,29],"1型文法","0型语法","2型文法","3型文法","由&quot;非终结符--&gt;符号串&quot;这种产生式构成的文法是()","v1",0,{"answer":34,"createTime":23,"id":35,"options":36,"question":41,"source":31,"type":32},[],176211482,[37,38,39,40],"语义分析","目标代码生成","词法分析","语法分析","在编译中产生语法树是为了()",{"answer":43,"createTime":23,"id":44,"options":45,"question":50,"source":31,"type":32},[],176211484,[46,47,48,49],"SLR(1)","LR(1)","LL(K)","算符优先法","下面哪种不是自底向上的语法分析文法( )",{"answer":52,"createTime":23,"id":53,"options":54,"question":59,"source":31,"type":32},[],176211489,[55,56,57,58],"无限循环","回溯","非法调用","有限次调用","在递归子程序方法中,若文法存在左递归,则会使分析过程产生()",{"answer":61,"createTime":23,"id":62,"options":63,"question":68,"source":31,"type":32},[],176211492,[64,65,66,67],"\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":70,"createTime":5,"id":71,"options":72,"question":77,"source":31,"type":32},[],176211495,[73,74,75,76],"a+b\u002Fc+d","a+b+c\u002Fd","a+b\u002F(c+d)","(a+b)\u002F(c+d)","后缀式 ab+cd+\u002F可用表达式( )来表示",{"answer":79,"createTime":5,"id":80,"options":81,"question":86,"source":31,"type":32},[],176211499,[82,83,84,85],"自底向上","自顶向下","自右向左","自左向右","递归下降子程序法属于( )语法分析方法",{"answer":88,"createTime":5,"id":89,"options":90,"question":95,"source":31,"type":32},[],176211502,[91,92,93,94],"自底向上分析法","自顶向下分析法","LALR分析法","SLR分析法","LR分析法属于( )",{"answer":97,"createTime":5,"id":98,"options":99,"question":104,"source":31,"type":32},[],176211505,[100,101,102,103],"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":106,"createTime":5,"id":6,"options":107,"question":19,"source":31,"type":32},[],[8,9,10,11]]