PEGã¨æ§‹æ–‡è§£æžã«é–¢ã™ã‚‹ã‚¢ãƒ¬ã‚³ãƒ¬ã®å‹‰å¼·ä¼š Vol.1 (2015/08/08 13:30〜)
Parsing Expression Grammar(PEG)ã¯ã€Bryan Fordã«ã‚ˆã£ã¦POPL 2004ã§ç™ºè¡¨ã•ã‚ŒãŸæ–‡æ³•ã®å½¢å¼åŒ–ã§ã™ã€‚PEGã¯Recognition(èªè˜ï¼‰ã‚’ベースã¨ã—ã¦ãŠã‚Šã€Context Free Grammar(CFG)ã¨ç•°ãªã£ã¦ã„ã¾ã™ã€‚ PEGã¯æ›–昧ã§ãªã„言語をå—ç†ã™ã‚‹ã®ã«ä¾¿åˆ©ãªç‰¹æ€§ã‚’æŒã£ã¦ãŠã‚Šã€PEGをベースã«ã—ãŸæ§‹æ–‡è§£æžå™¨ç”Ÿæˆç³»ãŒå¤šæ•°ç™»å ´ã—ã¦ã„ã¾ã™ã€‚ã¾ãŸã€PEGã¯ãƒ‘ーザコンビãƒãƒ¼ã‚¿ã¨å‘¼ã°ã‚Œã‚‹ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžå†…ã«æ§‹æ–‡è§£æžç”¨DSLを埋ã‚込む手法ã¨ã‚‚関連ãŒã‚ã‚Šã¾ã™ã€‚ ã“ã®å‹‰å¼·ä¼šã§ã¯ã€ PEGã®åŸºæœ¬ PEGã®å¿œç”¨ä¾‹ï¼ˆæ§‹æ–‡è§£æžå™¨ç”Ÿæˆç³»ã€ãƒ‘ーザコンビãƒãƒ¼ã‚¿ãªã©ï¼‰ PEGã®æ‹¡å¼µ ç‰ã«ã¤ã„ã¦å‹‰å¼·ã—ã¾ã™ï¼ˆPEGã«é–¢ã™ã‚‹äºˆå‚™çŸ¥è˜ã¯ãªãã¦æ¸ˆã‚€ã‚ˆã†ã«ã™ã‚‹ã¤ã‚‚ã‚Šã§ã™ï¼‰ã€‚ã¾ãŸã€ PEG以外ã®æ§‹æ–‡è§£æžæ‰‹æ³• LL法 LR法 LL(*)法 (ANTLR) GLR法 GLL法 PEG以
PEG基礎文法最速マスター - kmizuã®æ—¥è¨˜
Scala基礎文法最速マスターを書ã“ã†ã‹è¿·ã£ã¦ã„ãŸã‚‰ã€æ—¢ã«yuroyoroã•ã‚“ã«æ›¸ã‹ã‚Œã¦ã—ã¾ã£ãŸã®ã§ã€ã¡ã‚‡ã£ã¨é•ã†æ–¹å‘ã§ã€‚BNFã‚’æ—¢ã«çŸ¥ã£ã¦ã„る人ã¯ã€ã“れをèªã‚ã°PEGã®åŸºç¤Žã‚’マスターã—ã¦PEGを書ãã“ã¨ãŒã§ãるよã†ã«ãªã‚‹ã§ã—ょã†(ã»ã‚“ã¨ã‹ï¼Ÿ)。 基本 Parsing Expression Grammar(PEG)ã¯BNFã«ä¼¼ã¦ã„ã‚‹ã‘ã©ã€ã¡ã‚‡ã£ã¨(ã‹ãªã‚Šï¼Ÿ)é•ã†æ–‡æ³•ã®è¡¨è¨˜æ³•ã§ã™ã€‚BNFã¯ãã®æ–‡æ³•ãŒã©ã®ã‚ˆã†ãªè¨€èªžã‚’表ç¾ã—ã¦ã„ã‚‹ã‹ã‚’定ã‚ã‚‹ã®ã«å¯¾ã—ã¦ã€PEGã¯å…¥åŠ›ãŒã©ã®ã‚ˆã†ã«è§£æžã•ã‚Œã‚‹ã‹ã‚’定ã‚ã¾ã™ã€‚PEGã¨BNFã®ä¸€ç•ªå¤§ããªé•ã„ã¯ã€PEGã«ã¯æ›–昧ã•ãŒç„¡ã„ã“ã¨ã§ã™ã€‚ãŸã¨ãˆã°ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®if文を表ç¾ã™ã‚‹æ¬¡ã®æ“¬ä¼¼BNFã«ã¯æ›–昧ã•ãŒã‚ã‚Šã¾ã™ã€‚ statement ::= if_statement | ...; if_statement ::= IF LPAREN expr RPAREN sta
PEG Parser Generator + Packrat Parserを実装ã—ã¦ã¿ãŸ - LINE ENGINEERING
詳ã—ã„解説ã¯ãƒãƒƒãƒˆä¸Šã«æ²¢å±±å˜åœ¨ã™ã‚‹ã®ã§å‰²æ„›ã—ã¾ã™ãŒã€ã”覧ã®ã‚ˆã†ã«EBNFã®è¡¨ç¾ã®ä¸€ã¤ã«ï¼ˆEBNFã¯ã„ãã¤ã‹ã®è¡¨ç¾æ–¹æ³•ãŒã‚るよã†ã§ã™ã€‚例ãˆã°ã“ã‚Œã¯W3CãŒå®šç¾©ã—ã¦ã„ã‚‹ã‚‚ã®ã§ã™ï¼‰ä¼¼ã¦ã„ã¾ã™ã€‚é•ã„ã¯å…ˆã«è¿°ã¹ãŸã‚ˆã†ã«Choiceã®åƒããŒç•°ãªã‚‹ã®ã¨ã€æ–‡æ³•ä¸Šã«å…ˆèªã¿ãŒå˜åœ¨ã™ã‚‹ã“ã¨ã§ã™ã€‚ ã“ã®PEGを使ã£ã¦å››å‰‡æ¼”ç®—ã‚’å—ç†ã™ã‚‹ã‚·ãƒ³ãƒ—ルãªãƒ«ãƒ¼ãƒ«ã‚’書ãã¨ã™ã‚‹ã¨ã€ä¾‹ãˆã°ã“ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚ # expressionã‹ã‚‰ãƒ‘ースãŒå§‹ã¾ã‚‹ã¨ã™ã‚‹ expression <- additive additive <- multitive ("+" multitive / "-" multitive)* multitive <- primary ("*" primary / "/" primary)* primary <- "(" expression ")" / number number <- digit+ digit
PEGã¨C++11ã§ä½œã‚‹è¨€èªžå‡¦ç†ç³» - Qiita
PEGã¨C++11ã§ä½œã‚‹è¨€èªžå‡¦ç†ç³» 言語処ç†ç³»ã®ä½œæˆã¨èžãã¨ã€é›£æ˜“度ãŒé«˜ã„ã¨æ„Ÿã˜ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“。ã—ã‹ã—パーサージェãƒãƒ¬ãƒ¼ã‚¿ãªã©ã®ãƒ„ールを活用ã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦ï¼Œãã®æ•·å±…ã¯ãã£ã¨ä½Žããªã‚Šã¾ã™ã€‚ ã“ã®åˆ†é‡Žã§ã¯ã€BNFã‹ã‚‰ãƒ‘ーサーを生æˆã™ã‚‹YaccãŒæœ‰åã§ã™ã€‚最近ã§ã¯ PEG（Parser Expression Grammar）も知られるよã†ã«ãªã£ã¦ãã¾ã—ãŸã€‚PEGã®ç‰¹å¾´ã®ä¸€ã¤ã¯ï¼Œæ§‹æ–‡ãƒ«ãƒ¼ãƒ«ã ã‘ã§ãªãå—å¥ãƒ«ãƒ¼ãƒ«ã‚‚åŒæ™‚ã«å®šç¾©ã§ãã‚‹ã“ã¨ã§ã™ã€‚ç¾åœ¨ã€ä¸»è¦ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ã»ã¨ã‚“ã©ã«PEGパーサージェãƒãƒ¬ãƒ¼ã‚¿ãŒå˜åœ¨ã—ã¾ã™ã€‚ä¸ã«ã¯æŠ½è±¡æ§‹æ–‡æœ¨ï¼ˆAST）ã¾ã§ç”Ÿæˆã—ã¦ãれるもã®ã‚‚ã‚ã‚Šã¾ã™ã€‚ ã“ã†ã—ãŸãƒ„ールã®åŠ©ã‘を活用ã™ã‚‹ã¨ï¼Œè¨€èªžå‡¦ç†ç³»ã®ä½œæˆã¯ã‹ãªã‚Šå®¹æ˜“ã«ãªã‚Šã¾ã™ã€‚PEGã§æ–‡æ³•ã‚’定義ã—，ASTを実行ã™ã‚‹è©•ä¾¡å™¨ã‚’実装ã™ã‚Œã°ï¼Œã‚ã¨ã¯PEGライブラリã®åŠ©ã‘を借りã¦è¨€èªžå‡¦ç†ç³»ã‚’完æˆã•ã›ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ 今回ã¯æ‹™ä½œã®
ç«œ TatSu (PEG parsers in Python) ã®ã¸ã‚ã‚ã‚‹ã© | site-hhs
Parsing In Python: Tools And Libraries より。 ç«œ TatSu。Arpeggioã¨åŒã˜ã PEG 系。ãã—ã¦ã“ã“ã¾ã§ã¿ã¦ã㟠PEG ç³»ã¨ã¯æ˜Žã‚‰ã‹ã«ç•°ç«¯ã€ã ã‘ã‚Œã©ã‚‚ã€åˆè¦‹ã§ã®ç¬¬ä¸€å°è±¡ã¯ã€Œæœ€ã‚‚フレã‚シブルã§å®Œæˆåº¦ã‚‚高ãã†ã€ã¨ã„ã†ã‚‚ã®ã€‚ 異端: ç«œ TatSu (the successor to Grako) is a tool that takes grammars in a variation of EBNF as input, and outputs memoizing (Packrat) PEG parsers in Python. EBNF (ã®å¤‰ç¨®?) ã‹ã‚‰ PEG パーサを生æˆã™ã‚‹ã€ã¨ã„ã†ã“ã¨ã¯ã€ã€Œorderd choiceã€ã§ãƒ‘ーサã®æŒ¯ã‚‹èˆžã„ãŒå¤‰ã‚ã‚Šã†ã‚‹ã€ã¨ã„ã†ã“ã¨ã ã¨æ€ã†ãŒã€ã“ã®å·®ç•°ã¯è„³å†…変æ›ã›ã‚ˆã€ã¡ã…ã“ã¨? ãªãŒãƒ¼ã„ rational
A Meta-Grammar for PEG Parsers
This week we make the parser generator “self-hostedâ€, meaning the parser generator generates its own parser. [This is part 7 of my PEG series. See the Series Overview for the rest.] So we have a parser generator, a piece of which is a parser for grammars. We could call this a meta-parser. The meta-parser works similar to the generated parsers: GrammarParser inherits from Parser, and it uses the sa
Left-recursive PEG grammars
I’ve alluded to left-recursion as a stumbling block a few times, and it’s time to tackle it. The basic problem is that with a recursive descent parser, left-recursion causes instant death by stack overflow. [This is part 5 of my PEG series. See the Series Overview for the rest.] Consider this hypothetical grammar rule: expr: expr '+' term | termIf we were to naively translate this grammar fragment
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
PEG parser combinators (Gauche Users’ Reference)
GitHub - we-like-parsers/pegen: PEG parser generator for Python
GitHub - erikrose/parsimonious: The fastest pure-Python PEG parser I can muster
Replacing CPython’s parser - Python Language Summit 2020
Incremental Packrat Parsing
http://web.cs.ucla.edu/~todd/research/pepm08.pdf
[PDF] Parsing Expression Grammars: A Recognition-Based Syntactic Foundation
竜 TatSu — 竜 TatSu 5.16.0 documentation
PEG at the Core Developer Sprint
Implementing PEG Features
Adding actions to a PEG grammar
GitHub - we-like-parsers/pegen_experiments: Experiments for the official PEG parser generator for Python
Visualizing PEG Parsing
{{#tags}}- {{label}}
{{/tags}}