1 / 7

/* the cc.cup file begins */ import java_cup.runtime.*; init with {: scanner.init(); :}; scan with {: return scanne

Contoh pemakaian Cup - Parser Generator available at telaga.cs.ui.ac.id/WebKuliah/IKI40800/newstuffs/CupScCGrammar.ppt see also telaga.cs.ui.ac.id/WebKuliah/IKI40800/newstuffs/minimal.jar. /* the cc.cup file begins */ import java_cup.runtime.*; init with {: scanner.init(); :};

payton
Download Presentation

/* the cc.cup file begins */ import java_cup.runtime.*; init with {: scanner.init(); :}; scan with {: return scanne

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Contoh pemakaian Cup - Parser Generatoravailable attelaga.cs.ui.ac.id/WebKuliah/IKI40800/newstuffs/CupScCGrammar.pptsee alsotelaga.cs.ui.ac.id/WebKuliah/IKI40800/newstuffs/minimal.jar /* the cc.cup file begins */ import java_cup.runtime.*; init with {: scanner.init(); :}; scan with {: return scanner.next_token(); :}; /* terminals (tokens returned by the scanner ). */ terminal c,d; /* Non-Terminals */ non terminal S,C; S ::= C C; C ::= c C | d; /* the cc.cup file ends */ The ScC grammar example

  2. The script on bunga.mhs.cs.ui.ac.id Checking for non-reduced productions... Writing parser... ===== Terminals ===== [0]EOF [1]error [2]c [3]d ===== Non terminals ===== [0]$START [1]S [2]C ===== Productions ===== [0] S ::= C C [1] $START ::= S EOF [2] C ::= c C [3] C ::= d The ScC grammar example

  3. ===== Viable Prefix Recognizer ===== START lalr_state [0]: { [C ::= (*) c C , {c d }] [$START ::= (*) S EOF , {EOF }] [C ::= (*) d , {c d }] [S ::= (*) C C , {EOF }] } transition on c to state [4] transition on d to state [3] transition on C to state [2] transition on S to state [1] ------------------- lalr_state [1]: { [$START ::= S (*) EOF , {EOF }] } transition on EOF to state [7] The ScC grammar example

  4. ------------------- lalr_state [2]: { [C ::= (*) c C , {EOF }] [C ::= (*) d , {EOF }] [S ::= C (*) C , {EOF }] } transition on c to state [4] transition on d to state [3] transition on C to state [6] ------------------- lalr_state [3]: { [C ::= d (*) , {EOF c d }] } ------------------- lalr_state [4]: { [C ::= c (*) C , {EOF c d }] [C ::= (*) c C , {EOF c d }] [C ::= (*) d , {EOF c d }] } transition on c to state [4] transition on C to state [5] transition on d to state [3] The ScC grammar example

  5. ------------------- lalr_state [5]: { [C ::= c C (*) , {EOF c d }] } ------------------- lalr_state [6]: { [S ::= C C (*) , {EOF }] } ------------------- lalr_state [7]: { [$START ::= S EOF (*) , {EOF }] } The ScC grammar example

  6. -------- ACTION_TABLE -------- From state #0 [term 2:SHIFT(to state 4)] [term 3:SHIFT(to state 3)] From state #1 [term 0:SHIFT(to state 7)] From state #2 [term 2:SHIFT(to state 4)] [term 3:SHIFT(to state 3)] From state #3 [term 0:REDUCE(with prod 3)] [term 2:REDUCE(with prod 3)] [term 3:REDUCE(with prod 3)] From state #4 [term 2:SHIFT(to state 4)] [term 3:SHIFT(to state 3)] From state #5 [term 0:REDUCE(with prod 2)] [term 2:REDUCE(with prod 2)] [term 3:REDUCE(with prod 2)] From state #6 [term 0:REDUCE(with prod 0)] From state #7 [term 0:REDUCE(with prod 1)] ------------------------------ The ScC grammar example

  7. -------- REDUCE_TABLE -------- From state #0 [non term 1->state 1] [non term 2->state 2] From state #1 From state #2 [non term 2->state 6] From state #3 From state #4 [non term 2->state 5] From state #5 From state #6 From state #7 ----------------------------- ------- CUP v0.10k Parser Generation Summary ------- 0 errors and 0 warnings 4 terminals, 3 non-terminals, and 4 productions declared, producing 8 unique parse states. 0 terminals declared but not used. 0 non-terminals declared but not used. 0 productions never reduced. 0 conflicts detected (0 expected). Code written to "parser.java", and "sym.java". ---------------------------------------------------- (v0.10k) The ScC grammar example

More Related