2007 CS Part 05: (ONO, Kouichi)

Size: px

Start display at page:

Download "2007 CS Part 05: (ONO, Kouichi)"

厉劳
4 years ago
Views:

1 2007 CS Part 05: (ONO, Kouichi)

2 , (expression, formula) (arithmetic expression) (logical expression, logic formula) CS

3 (operator) ( ) (0 ) ( ) CS

4 ( ) (arity) (unary operator) (!) (binary operator) / / / (+,-,*,/) / (&&, ) (==) (=) (ternary operator) (?:) (quadternary operator)? n (n-ary operator) CS

5 (notation) (prefix notation) (infix notation) (postfix notation) CS

6 * (+) 2 3 (*) ( ) * 6 CS

7 * Call-by- Value ( r ) * r 6 CS

8 :? (+) (-) (*) (/) Call-by-Value? * 2-8 / / 9 4 CS

9 BNF BNF <expr> ::= <op> <expr> <expr> <digits> <op> ::= + - * / <digits> ::= <digit> <digits> <digit> <digit> ::= CS

10 / (+) 3 5 (/) ( ) / 2 CS

11 / Call-by- Value ( s ) s 2 / CS

12 :? (+) (-) (*) (/) Call-by-Value? * 6 5 / / CS

13 BNF BNF <expr> ::= <expr> <expr> <op> <digits> <op> ::= + - * / <digits> ::= <digit> <digits> <digit> <digit> ::= CS

14 / (Polish Notation) (Reverse Polish Notation/RPN, Inverse (Inverted) Polish Notation/IPN) Polish ( ) ( ) Polish Jan Łukasiewicz/ ( / ) CS

15 Jan Łukasiewicz Polish Łukasiewicz Notation US ( UK ) ( ) CS

16 + 3 5 addition of 3 and 5 / division of addition of 3 and 5 with 2 ( ) CS

17 / 3 5 ( )2 ( ) CS

18 CS

19 (precedence) (associativity/association) CS

20 (precedence) CS

21 (+,-) (*,/) 2 * ( 2 * 3 ) * ( 3 * 5 ) ( ) * 5 CS

22 ( ) (left associativity/association) (right associativity/association) CS

23 (+) (-) ( 7-4 ) ( ) CS

24 ( ) CS

25 C/C++/Java ( = ) Pascal (Pascal := ) Fortran ** Basic ^ C/C++/Java ( ) CS

26 (=) C/C++/Java int a = 10; int b = 20; a = b = 30; a = ( b = 30 ); a b = 30 ( ) 30 a CS

27 COBOL Fortran 2 ** 3 ** 4 2 ** ( 3 ** 4 ) ( 2 ** 3 ) ** 4 CS

28 2 + 3 * 6 (*) 3 6 (+) 2 3 * ( ) * 6 CS

29 BNF BNF <expr> ::= <expr> <asop> <term> <term> ::= <term> <mdop> <factor> <factor> ::= <digits> ( <expr> ) <asop> ::= + - <mdop> ::= * / <digits> ::= <digit> <digits> <digit> <digit> ::= CS

30 ? BNF CS

31 ( ) syntax tree (parse tree) : ( ) * 6 expr nonterminal symbol 2 terminal symbol expr term term mdop factor factor CS * ( expr ) expr asop term term + factor factor digits digits digit digit 3 2 digits digit 6

32 (abstract syntax tree/ast) (concrete syntax tree/cst) : ( ) * 6 * CS

33 int eval(node tree) { if (tree ) // tree 2 return tree Operator op = tree.getoperator(); } Node tree1 = tree.getarg(1); Node tree2 = tree.getarg(2); int r1 = eval(tree1); int r2 = eval(tree2); return op.apply(r1,r2); CS *

34 ( ) traverse(, ) * CS

35 traverse (traverse order) pre-order post-order in-order * CS

36 pre-order traverse root node node node subtree pre-order traverse prefix notation * (1) * (2) + (5) (3) (4) CS

37 post-order traverse root node node subtree node post-order traverse postfix notation * (5) * (3) + (4) (1) (2) CS

38 in-order traverse root node node subtree node node 2 subtree in-order traverse infix notation?? (4) * 6 * (2) + (5) (1) (3) CS

39 in-order traverse in-order traverse infix notation * 6 ( ) * 6 (4) * (2) + (5) (1) (3) CS

40 ? node naive : (4) * (2) + (5) (1) (3) CS

41 naive naive naive way (naive ) CS

42 naive root node ( ( ) node subtree node ( node ) node 2 subtree ( ) ) (4) * (((2) + (3)) * (6)) (2) + (5) (1) (3) CS

43 naive (((2) + (3)) * (6)) ( ) * 6 ( ) /? (4) * (2) + (5) (1) (3) CS

44 (cont d) / node a, b ( node a node b) a b b a node b b a node a CS

45 parse : * * : * * : (2+3)*6 ( ) * 6 * CS

46 parse: node arity tree node node / node/ node * * CS

47 parse: node arity node pop node node node push / node/ node push * * CS

48 parse: (+,-) parse CS

49 parse: (cont d) 2 (+,-) (*,/) * parse * 3 4 CS

50 parse: (cont d) 2 2 * ( 3 / ( 4-5 ) ) parse 2 2 / 3 - CS * 4 5

51 / / / / CS

52 / ( ) * 6 Call-by-Value strict evaluation ( r ) r * 6 * CS

53 / ( ) * ( 7 1 ) ( r,s ) * r s ( * ) * CS

54 / C/C++ Java ( / ) ( ) CS

55 C/C++ C/C++ / ( ) ( ) &&,?:, CS

56 CS

57 : C int m = 10; int n = m * m++; C * m m++ C * n 100 n 110 C CS

58 : C/C++ (=, += ) LHV RHV CS

59 : C int a[10] = { 0 }; int i; for (i = 0; i < 5; a[i] = i++); C = a[i] i++ C = a {0,1,2,3,4,0,0,0,0,0} a {0,0,1,2,3,4,0,0,0,0} C CS

60 C ANSI/ISO C ( C89) ( ) x * y * z * ( x * y ) * z ( x * y ) * z = x * ( y * z ) x * ( y * z ) C89 CS

61 ( ) / CS

62 (stack machine) ( ) ( ) ( ) (push,pop ) CS

63 1 top arity top strict evaluation 1 CS

64 * * 30 CS

65 CS

66 FORTH Charles (Chuck) H. Moore 1968 Java VM FORTH ( Java VM ) Intel 80x87 FORTH PostScript (Printer Description Language/PDL) Adobe 1984 Apple (LaserWriter) PDF (Portable Document Format) CS

67 FORTH: SWAP SWAP 5 * SWAP * CS

68 FORTH: ROT ROT * ROT 4-2 * CS

69 FORTH: DUP 2 DUP * 3 DUP * + 2 DUP 2 * DUP 3 * CS

70 PostScript /Times-Roman findfont 200 scalefont setfont moveto 60 rotate (Sample) show showpage Sample CS

Microsoft Word - 11900電腦軟體設計.doc

Microsoft Word - 11900電腦軟體設計.doc 技能檢定規範之一一九電腦軟體行政院勞工委員會職業訓練局編印軟體技術士技能檢定規範目錄一軟體技術士技能檢定規範說明... 1 二丙級軟體技術士技能檢定規範... 3 三乙級軟體技術士技能檢定規範... 5 四甲級軟體技術士技