CS241 Study Guide - Final Guide: Regular Expression, Parse Tree, Symbol Table
Document Summary
1 mips: translate the following assembly language program into machine lan- guage, represented by hexadecimal values lis . word loc lw , 0() beq sh, sh, 1 loc: jr sw , 8() Make your nfa as simple as possible: write a regular expression that recognizes strings that include at most one a using = { a, b, c } 3 context-free grammars: what is the di erence between a left-canonical derivation and a right- canonical derivation, using the following cfg, generate the string aubic . 4 parsing: ll(1) vs lr(1, using the following lr(1) grammar, parse the string (cid:96) $ & @ % * (cid:97) . 5 semantic analysis: last chance to check for compile-time errors, what kinds of errors are caught during semantic analysis, apply the wlpp type rules to determine whether the expression. &(*(a + (*a + b + a - &c) * (*(new int[5] + 3)))) is well-typed or not.
