WHILE轮回语句的翻译法度模范设计（国外英文资料）.doc

WHILE循环语句的翻译程序设计（国外英文资料） The recursive descent method outputs three address codes / / / / / / / / / # define MAX. 100 # include iostream. H # include stdio, h # include string. H Char STR (MAX); Char ch; Int turn; Char strToken (MAX); Int kind; Int n = 0; / / the number of elements of strtoken [] Struct Word / / structure holds words { Int sort; Char word (MAX); / / the content of strtoken [] }; / / record [x] = new Word; The Word * record [12]. / / put all the identified words, each of their Numbers and strings. X is their index / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / /, / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / Int buffer () / / load { Int I = 0; The cout input program, # is the end mark. endl; For (int n = 0; n = MAX; n + +) { For (; I = MAX; I + +) { Scanf ( % c , STR [I]); B: / / / / / / cin STR [I] is not available, read in C. If (STR [I] = = #) Break; / / / / if the number of the ends is id #, then the program reads and jumps out of the loop. } Break; } Return (I); } A: bool IsLetter (char ch) / / / / / / or is it a letter { If (ch = 65 ch = 90 |, |, = 97 ch = 122) Return (true); The else Return (false); } Bool IsDigit (char ch) / / / / / / is the number { If (ch, = 48 ch = 57) Return (true); The else Return (false); } Char GetChar (int I) / / / reading character { Char ch; Ch = STR [I]; Return (ch); } Char GetBC (char ch) / / determines if it is a space or line, if it is, read the next character straight to no longer blank { If (ch = = 32 | | ch = = 10) { Turn++; Ch = GetChar (turn); Ch = GetBC (ch); / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / Return (ch); } The else Return (ch); } Void Concat () / / / / / / connection, which is the value of strtoken [] { StrToken [n] = ch; N++; } The int Reserve () / / / the word is used to find the reserved word, which is the return code, not t