Parsing Left Recursive PEG
•
2 gostaram•2,176 visualizações
the algorithm to parsing left recursive PEG rules with packrat parsing
![Parsing Left Recursive PEG with C++ www.kstm.org id:eldesh [email_address]](https://image.slidesharecdn.com/peg-110514083217-phpapp02/85/Parsing-Left-Recursive-PEG-1-320.jpg)
![[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],Who am I ?](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)
Recomendados
Mais conteúdo relacionado
Mais procurados
Mais procurados (19)
Destaque
Destaque (15)
Semelhante a Parsing Left Recursive PEG
Semelhante a Parsing Left Recursive PEG (15)
Último
Último (12)
Parsing Left Recursive PEG
- 1. Parsing Left Recursive PEG with C++ www.kstm.org id:eldesh [email_address]
- 13. Memoization Table column 1 2 3 4 5 6 7 8 Add Mul Prim Dec input 2 * ( 3 + 4 )
- 14. Memoization Table column 1 2 3 4 5 6 7 8 Add 7,7 X 4,7 X X Mul 3,5 X 4,7 X X Prim 3,5 X 4,7 X X Dec X 3,5 X 4,7 X X input 2 * ( 3 + 4 )
- 15. Memoization Table semantic value column 1 2 3 4 5 6 7 8 Add 7,7 X 4,7 X X Mul 3,5 X 4,7 X X Prim 3,5 X 4,7 X X Dec X 3,5 X 4,7 X X input 2 * ( 3 + 4 )
- 16. Memoization Table column number column 1 2 3 4 5 6 7 8 Add 7,7 X 4,7 X X Mul 3,5 X 4,7 X X Prim 3,5 X 4,7 X X Dec X 3,5 X 4,7 X X input 2 * ( 3 + 4 )
- 19. マッチの様子？ 1 - 3 - 5 Expr Expr Num input Num Num Expr ← Expr '-' Num / Num Num ← [1-9][0-9]*
- 29. マッチの様子 ( 再び ) 1 - 3 - 5 Expr (Grow1) Num input Num Num(Seed) Expr (Grow2) Expr Expr ← Expr '-' Num / Num (input: '1-3-5')
- 30. MemoizationTable の様子 LR ？ LR ！ Fail 3,2 3,2 seed parse! Expr ← Expr '-' Num / Num Num ← [1-9][0-9]* ; input: '3-4' 4,4 3-4,4 Growing! column 1 2 3 4 Expr Num input 3 - 4
- 33. Table behavior of parsing Indirect Left Recursion X ← Expr Expr ← X '-' Num / Num (Input: '4-3') LR ？ LR ？ LR ！ Fail 4,2 4,2 4,2 seed parse! キャッシュが見つかってしまう！ column 1 2 3 4 X Expr Num input 4 - 3
- 38. Adding Support for Indirect Left Recursion memo<pair<rule,pos> , pair<LR, optional<svalue>>> struct LR { AST seed; Rule rule Head head; LR * next; }; struct Head { Rule rule; RuleSet involvedSet,evalSet; }
- 39. Indirect Left Recursion X ← Expr Expr ← X '-' Num / Num (Input: '4-3') LR ？ LR ？ LR ！ Fail 4,2 4,2 4,2 seed parse! [email_address] X,{Expr} 4-3,4 3,4 4-3,4 growing! column 1 2 3 4 X Expr Num input 4 - 3
- 41. parse_ident(ID, Pos) { Entry * m = MEMO(ID, Pos); if (m==NULL) { MEMO(R, P) = new MEMOENTRY(P, TAG_LR); m->ans = EVAL(R.Body); if (m->lr.detected && ans!=NULL) return GROWLR(R, P, m); else return m; return m; } else { // エントリが見つかった場合 } }