Ngày tải lên :
22/02/2014, 10:20
... tree and ce is the control expression ce; of G; { (D2, u, A) I q ceh ce2, DI, tl: ce = cel.ce2 and "ce2 is not a concatenations and (DI, tl, A~) E CE-PARSER(GI, ce2, D, t) and (D2, u, A~) E CE,-PARSER(G,, ... groups called r u l e classes, each of which handles some linguistic phenomenon These rule classes are subdivided into transformation classes and meaningful rule classes A meaningful rule class handles ... CE,-PARSER(G,, ce,, D, ,t,) and A = Al orA2 } U { (D2, u, A) [ ce,, ce2: ce = cellce2 and "ce~ is not a disjunctions and (D2, u, A) e (OE-PARSER(G,, ce~, D, t) CF_,-PARSER(G;, ce, D, t) tries...