对于翻译模式R → addop T {http://img2.ph.126.net/W0kxC_oqhCGcgMXSIxmrNA==/6608671813352373524.png.i:= mknode(addop.lexme, R.i, T.nptr)} http://img2.ph.126.net/W0kxC_oqhCGcgMXSIxmrNA==/6608671813352373524.png {R.s:=http://img2.ph.126.net/W0kxC_oqhCGcgMXSIxmrNA==/6608671813352373524.png.s}R→ e {R.s:=R.i}编写R的翻译子程序如下： function R (in:↑AST_node): ↑AST_node; var nptr, i1,s1,s: ↑AST_node; addoplexeme: char; begin if sym=addop then begin addoplexeme:=lexval; advance; nptr:=T; i1:=mknode (addoplexeme, in, nptr); s1:=R (i1) s:=s1 end else s:= in; return s end;其中AST_node为抽象语法树(AST) 结点类型。关于该子程序实现，下列说法正确的是
举一反三
- 1 Complete the words. ► h a i r c u t haircut 1 f r _ _ _ e ____ 2 s _ _ s s _ r _ ____ 3 h _ _ r s t _ _ e ____ 4 h _ _ r d _ _ _ r ____ 5 p _ _ t _ n g ____ 6 t _ _ m ____ 7 c _ l _ _ r ____ 8 b l _ w – d r _ ____
- 1 Complete the words. ► k n i c k e r s knickers 1 _ n d _ r w _ _ r ____ 2 m _ t _ r _ _ l ____ 3 s l _ _ v _ ____ 4 t i _ _ t s ____ 5 s _ _ d e ____ 6 n _ c k l e ____ 7 b l _ _ s e ____ 8 e a _ _ i n s ____ 9 v _ _ t ____ 10 b _ _ t t _ n ____
- 下述构型的正确命名是:[img=699x118]17e43c757e82164.png[/img] A: (1)R (2)R (3)S B: (1)R (2)S (3)S C: (1)S (2)S (3)S D: (1)R (2)R (3)R
- 4 Complete the words. 25ba s t r a i g h t straight 1 p o i n _ _ _ ____ 2 L - s h a _ _ _ ____ 3 c u r _ _ _ ____ 4 r e c t a n _ _ _ ____ 5 v e r t i _ _ _ ____ 6 c i r c u _ _ _ ____ 7 r o _ _ _ ____ 8 c i r _ _ _ ____ 9 t r i a n _ _ _ ____ 10 h o r i z o n _ _ _ ____ 11 s q u _ _ _ ____ 12 p a r a l _ _ _ ____ 13 d i a m _ _ _ ____ 14 s _ _ _ - s h a p e d ____
- 若r(t)=1(t)，则R(S)=[img=12x43]180338b990837c3.png[/img]1/S