Add a "modern" parsing API · Issue #2993 · whatwg/html
TL;DR HTML should provide an API for parsing. Why? "Textual" HTML is a widely used syntax. HTML parsing is complex enough to want to use the browser's parser, plus browsers can do implementation tricks with how they create elements, etc. Unfortunately the way the HTML parser is exposed in the web platform is a hodge-podge. Streaming parsing is only available for main document loads; other things r
An Intro to Compilers | Nicole Orchard
tl;dr: Learning new meanings for front-end and back-end. A compiler is just a program that translates other programs. Traditional compilers translate source code into executable machine code that your computer understands. (Some compilers translate source code into another programming language. These compilers are called source-to-source translators or transpilers.) LLVM is a widely used compiler
Writing parsers like it is 2017
the morning paper a random walk through Computer Science research, by Adrian Colyer Writing parsers like it is 2017 Chifflier & Couprie, SPW’17 With thanks to Glyn Normington for pointing this paper out to me. Earlier this year we looked at ‘System programming in Rust: beyond safety‘ which made the case for switching from C to Rust as the default language of choice for system-level programming. To
HTTPパーサã«ãŠã‘ã‚‹SSE4.2最é©åŒ–ã®å¨åŠ›ã¨æ³¨æ„点 - Cybozu Inside Out | サイボウズエンジニアã®ãƒ–ãƒã‚°
ã“ã‚“ã«ã¡ã¯ã€ã‚µã‚¤ãƒœã‚¦ã‚ºãƒ»ãƒ©ãƒœã®å…‰æˆã§ã™ã€‚ PicoHTTPParserã¯@kazuhoã•ã‚“ãŸã¡ãŒé–‹ç™ºã—ã¦ã„る高速ãªHTTPパーサã§ã™ã€‚ åŒã˜ä½œè€…ã«ã‚ˆã‚‹HTTPサーãƒH2Oã«ã‚‚使ã‚ã‚Œã¦ã„ã¾ã™ã€‚ 11月4æ—¥ã®é–‹ç™ºãƒ–ãƒã‚°ã«ã‚ˆã‚‹ã¨ã€ãã®æ™‚点ã§Node.jsãªã©ã«ä½¿ã‚ã‚Œã¦ã„ã‚‹http-parserã®10å€ç¨‹åº¦ã®é€Ÿåº¦ã‚’誇るãã†ã§ã™ï¼ˆç¾åœ¨ã¯http-parserも速度å‘上ã—ãã®å·®ã¯ç¸®ã¾ã‚Šã¾ã—ãŸã€‚ãã‚Œã§ã‚‚4å€ä»¥ä¸Šã®å·®ãŒã‚るよã†ã§ã™ï¼‰ã€‚ 該当ブãƒã‚°ã«ã¯ãã®é«˜é€ŸåŒ–ã®ãŸã‚ã®ãƒŽã‚¦ãƒã‚¦ãŒæ›¸ã‹ã‚Œã¦ã„ã¦å¤§å¤‰èˆˆå‘³æ·±ã„ã§ã™ã€‚ãŸã Intelç³»CPUã«æ載ã•ã‚Œã¦ã„ã‚‹SIMD命令ã¯ç”¨ã„られã¦ã„ã¾ã›ã‚“ã§ã—ãŸã€‚今回ã€@kazuhoã•ã‚“ã¨ä¸€ç·’ã«æ–‡å—列処ç†å°‚用ã®SSE4.2を用ã„ã‚‹ã“ã¨ã§1.7～1.9å€ã®é«˜é€ŸåŒ–ã‚’é”æˆã—ã¾ã—ãŸï¼ˆImproving Parser Performance using SSE Instructions (in
JavaScriptã§ãƒ‘ーサコンビãƒãƒ¼ã‚¿ã®ã‚³ãƒ³ã‚»ãƒ—トをç†è§£ã™ã‚‹(「æ£è¦è¡¨ç¾ã ã‘ã«é ¼ã£ã¦ã¯ã„ã‘ãªã„ã€ã®ç¶šã) - id:anatooã®ãƒ–ãƒã‚°
å‰å›žã®è¨˜äº‹ã®ç¶šã。å‰å›žã¯ã€æ£è¦è¡¨ç¾ãŒä½¿ãˆãªã„時ã¯ãƒ‘ーサコンビãƒãƒ¼ã‚¿ã‚’使ã£ã¦ã¿ã‚‹ã¨è‰¯ã„ã¨ã„ã†ã“ã¨ã‚’書ã„ãŸã€‚ パーサコンビãƒãƒ¼ã‚¿ã®ãŸã‚ã®ãƒ©ã‚¤ãƒ–ラリã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ã«å„言語ã”ã¨ã«ã„ãã¤ã‹ã‚る。 JavaScript - Parsimmon Ruby - rparsec treetop Python - parsy PHP - PHPPEG å„言語ã§ã„ãã¤ã‹ã‚ã‚‹ã®ã ãŒã€æ£è¦è¡¨ç¾ã¨é•ã£ã¦ãƒ‘ーサコンビãƒãƒ¼ã‚¿ã«ã¯çµ±ä¸€çš„ãªæ›¸ãæ–¹ãŒã‚ã‚‹ã‚ã‘ã§ã¯ãªã„ã—ã€ãƒ©ã‚¤ãƒ–ラリã«ã‚ˆã£ã¦ä½¿ã„方も様々ã§ã‚る。ãªã®ã§ã€ä»Šã¾ã§æ£è¦è¡¨ç¾ã ã‘使ã£ã¦ããŸé–‹ç™ºè€…ãŒã¡ã‚‡ã£ã¨ä½¿ã£ã¦ã¿ã‚ˆã†ã¨æ€ã£ã¦ã‚‚ã€ä½¿ã„æ–¹ãŒã‚ˆãã‚ã‹ã‚‰ãšã«é¢é£Ÿã‚‰ã£ã¦ã—ã¾ã†ã“ã¨ãŒã‚る。 パーサコンビãƒãƒ¼ã‚¿ã¯ãƒ†ã‚ストをパースã™ã‚‹ãŸã‚ã®éžå¸¸ã«å¼·åŠ›ãªä»•çµ„ã¿ã ãŒã€ãã®èƒŒå¾Œã«ã‚る考ãˆæ–¹ã‚’ç†è§£ã—ãªã‘ã‚Œã°ã“れらã®ãƒ‘ーサコンビãƒãƒ¼ã‚¿ã®ãƒ©ã‚¤ãƒ–ラリを使ã†éš›ã®éšœå®³ã«ãªã‚‹ã ã‚ã†ã€‚逆ã«è¨€ã†ã¨ã€ãã‚Œã•ãˆç†è§£ã§
Spaghetti Source - å†å¸°ä¸‹é™åž‹æ§‹æ–‡è§£æž ( LL(1) )
説明 å†å¸°ä¸‹é™åž‹æ§‹æ–‡è§£æžã¯ BNF ã§ä¸Žãˆã‚‰ã‚ŒãŸæ–‡æ³•ã‚’解æžã™ã‚‹æ‰‹æ³•ã§ã‚る．与ãˆã‚‰ã‚ŒãŸ BNF を直接書ã下ã™ã“ã¨ã§ãƒ‘ーシングを行ã†ã“ã¨ãŒã§ãる．ã“ã“ã§ã¯ LL(1) パーザã®ä¾‹ã¨ã—ã¦å››å‰‡æ¼”算パーザを題æã«ï¼Œä½œæˆæ³•ã‚’示ã™ï¼Ž 1. BNF を書ã å†å¸°ä¸‹é™åž‹ã®ãƒ‘ーザを書ããŸã‚ã«ã¯ï¼Œã¾ãš BNF を書ã‹ãªã‘ã‚Œã°ãªã‚‰ãªã„．BNF ã§ã‹ã‘る文法ã¯äºŒåž‹æ–‡æ³•(文脈自由文法)ã¨ã‚ˆã°ã‚Œã‚‹ã‚¯ãƒ©ã‚¹ã«ãªã‚‹ï¼Žã“ã‚Œã¯å®Ÿç”¨ä¸Šæœ€ã‚‚有用ãªã‚¯ãƒ©ã‚¹ãªã®ã§ï¼Œå¤šãã®ç”¨é€”ã«ã¯ã“ã‚Œã§è¶³ã‚Šã‚‹ï¼Ž 四則演算㮠BNF ã¯æ¬¡ã®ã‚ˆã†ã«ãªã‚‹ï¼Žã©ã†ã›è‡ªåˆ†ã§ãƒ‘ーザを書ãã®ã§ BNF ã®ãã¡ã‚“ã¨ã—ãŸãƒ«ãƒ¼ãƒ«ã«å¾“ã£ã¦ã„ãªãã¦ã‚‚書ã‘ã‚‹æ°—ãŒã™ã‚Œã°é©å½“ãªãƒ«ãƒ¼ãƒ«ã‚’è¿½åŠ ã—ã¦ã‚ˆã„． equation := equation + factor | factor factor := factor * term | term term := (equation) | Num
boost::spiritã§æ§‹æ–‡è§£æžã‚’è¡Œã†ã€‚（多分）ãã®1 » ãŠã‹ã‚†å€¶æ¥½éƒ¨â€•ã‚½ãƒ¼ã‚¹ãŒå…¨ç„¶æ´—ã‚ã‚Œãªã„迷走ブãƒã‚°
boost::spiritã§ã€ã‚„ã£ã¨ã“ã•å‰å›žã®Expressionオブジェクトを作æˆã§ããŸã€‚ ã²ã©ã„ã€ã²ã©ã‹ã£ãŸâ€¦ 俺ã¿ãŸã„ãªã€Œã«ã‚ã‹ãƒ—ãƒã‚°ãƒ©ãƒžã€ãŒæ‰‹ã‚’出ã™ã‚ˆã†ãªã‚·ãƒãƒ¢ãƒŽã§ã¯ãªã‹ã£ãŸã‚ˆâ€¦ å±ã†ã「関数型プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°æ怖症ã€ã«é™¥ã‚‹ã¨ã“ã‚ã ã£ãŸã€‚ ã„ã‚„ã€ãƒ©ã‚¤ãƒ–ラリãã®ã‚‚ã®ã¯ã™ã”ã良ã出æ¥ã¦ã‚‹ï¼ˆã‚“ã ã¨æ€ã†ï¼‰ã—ã€ä¸€åº¦ä½¿ãˆã‚‹ã‚ˆã†ã«ãªã‚‹ã¨ä¾¿åˆ©ãªã‚“ã§ã€ã¾ãŸä½¿ã†ã¨æ€ã†ã‚“ã ã‘ã©ã•ã€‚ 用語ãŒã‚„ã‚„ã“ã—ã„ã®ã§ã€ä»Šå›žã¯BNFをコードã«è½ã¨ã™ã¨ã“ã‚ã¾ã§ã€‚ LL構文解æžã‚’è¡Œã†ãƒ©ã‚¤ãƒ–ラリ。 å‰å›žåŒæ§˜boost1.42。 boost::spirit::classic（旧spirit？）ã€boost::spirit::qi（構文解æžï¼‰ã€boost::spirit::lex（å—å¥è§£æžï¼‰ã€boost::spirit::karma（コードジェãƒãƒ¬ãƒ¼ã‚¿ï¼Ÿï¼‰ã®ãƒ©ã‚¤ãƒ–ラリã‹ã‚‰æˆã‚‹ã‚‰ã—ã„。 今回使ã†è§£æžéƒ¨åˆ†ã‚’è¡Œã†ãƒ©ã‚¤ãƒ–
構文解æžï¼ˆparser）
1. ã¯ã˜ã‚㫠コンパイラを構æˆã™ã‚‹å‡¦ç†è¦ç´ ã®ã†ã¡ã€ã€Œ1. å—å¥è§£æžã€ã«ã‚ˆã£ã¦ã€ãƒ—ãƒã‚°ãƒ©ãƒ ä¸ã®ãƒˆãƒ¼ã‚¯ãƒ³ï¼ˆå‘½ä»¤èªžã‚„リテラル）を切り出ã—ãŸå¾Œã®æ®µéšŽã§ã¯ã€ãã®ãƒˆãƒ¼ã‚¯ãƒ³ã®å±žæ€§ã¨æ–‡æ³•ã«è¨˜è¿°ã•ã‚ŒãŸæ§‹æ–‡è¦å‰‡ã«åŸºã¥ã„ã¦ã€å°Žå‡ºæœ¨ã‚’構æˆã™ã‚‹å¿…è¦ãŒã‚る。ã“ã®å‡¦ç†ã‚’「構文解æžï¼ˆparser）ã€ã¨å‘¼ã¶ã€‚コンパイラ内部ã§å°Žå‡ºæœ¨ã®æ§‹æˆä½œæ¥ã‚’è¡Œã†ã‚ˆã†ãªæ©Ÿèƒ½ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚’「構文解æžå™¨ã€ã¨å‘¼ã¶ã€‚ å—å¥è§£æžå™¨ã®å…¥åŠ›ãƒˆãƒ¼ã‚¯ãƒ³ã¯æ–‡å—（ã¨[EOF]）ã§ã‚る。構文解æžå™¨ã®å…¥åŠ›ãƒˆãƒ¼ã‚¯ãƒ³ã¯å—å¥ãƒˆãƒ¼ã‚¯ãƒ³ã§ã‚る。 構文è¦å‰‡ã®æ±ºå®šã®ãŸã‚ã€å®šç¾©ã•ã‚ŒãŸãƒˆãƒ¼ã‚¯ãƒ³ã‚’用ã„ã¦è¨˜è¿°ã—ãŸã€å˜èª¿BNF（Backus Naur Form）ã‚ã‚‹ã„ã¯æ‹¡å¼µBNFå½¢å¼ã‚’用ã„ã¦æ–‡æ³•ã‚’作æˆã™ã‚‹ã€‚ 文法ã®è¡¨ç¾ã®ä»•æ–¹ã«ã¯ã€å¤§ãã分ã‘ã¦ä»¥ä¸‹ã®ï¼’ã¤ãŒã‚る。 ・è¦å‰‡ã®ä¸Šã‹ã‚‰ä¸‹ã¸å‘ã‘ã¦ç”Ÿæˆã™ã‚‹æ–¹æ³•ï¼ˆä¸‹é™åž‹ï¼šLL法） ・è¦å‰‡ã®ä¸‹ã‹ã‚‰ä¸Šã¸å‘ã‘ã¦ç”Ÿæˆã™ã‚‹æ–¹æ³•ï¼ˆä¸Šæ˜‡åž‹ï¼šLR法） 下é™åž‹ã¯ã€æ•°å¼ã‚„è«–
1
ランã‚ング
ランã‚ング
ãŠçŸ¥ã‚‰ã›
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
https://docs.google.com/presentation/d/11Y9EtyM6wUSFEdU_c_DEhgkEV1UMl7K29Zk__hjpxCI/present
{{#tags}}- {{label}}
{{/tags}}