Steven Kalt
SummaryThis is a cautionary tale about how I ended up writing a (bad) regular expression parser and evaluator in pure TypeScript types. type HexStr<S extends string> = Recognize<"[0-9a-fA-F]+", S>; type IsMatch<S extends string> = HexStr<S> extends S ? true : false; const isHex: IsMatch<"deadbeef"> = true const notHex: IsMatch<"nope"> = false The novelty here is parsing and evaluating regular expr
JSã§æ›¸ã‹ã‚ŒãŸECMAScript RegExpパーサーã®æ¯”較 | Memory ice cubes
OXCã§æ£è¦è¡¨ç¾ãƒ‘ーサーを実装ã—ã¦ã‚‹ã¨ãã«å…¨éƒ¨ä¸€é€šã‚Šèªã‚“ã§ã¿ã¦ã€ã¿ã‚“ãªé•ã£ã¦ã¿ã‚“ãªè‰¯ã„ã£ã¦ãªã£ãŸã®ã§ã€‚ 候補ã¯ã“ã¡ã‚‰ã®3ã¤ã€‚ https://github.com/jviereck/regjsparser https://github.com/DmitrySoshnikov/regexp-tree https://github.com/eslint-community/regexpp ã‹ã®AST Explorerã§ã‚‚ã€RegExp部門ã§ã¯ã“ã®3ã¤ãŒãƒªã‚¹ãƒˆã«ã‚る。 AST explorer https://astexplorer.net/ å‰æ ECMAScript本体ã ã¨ã€ESTreeã¨ã„ã†ãƒ‡ãƒ•ã‚¡ã‚¯ãƒˆãŒã‚ã‚‹ã‘ã©ã€æ®‹å¿µãªãŒã‚‰RegExpã«ã¯ãªã„。 ESTreeã§ã®RegExpã®æ‰±ã„ã¯ã“ã‚“ãªæ„Ÿã˜ã§ã€ãŸã ã®æ–‡å—列ã§ã—ã‹ãªã„。 interface RegExpLiteral <: Literal
TypeScript 5.5 ã§è¿½åŠ ã•ã‚ŒãŸæ£è¦è¡¨ç¾æ§‹æ–‡ãƒã‚§ãƒƒã‚¯ã‚’ç†è§£ã™ã‚‹
TypeScript 5.5ã§ã€@graphemeclusterã•ã‚“ã«ã‚ˆã£ã¦æ£è¦è¡¨ç¾ãƒªãƒ†ãƒ©ãƒ«ã®æ§‹æ–‡ãƒã‚§ãƒƒã‚¯ãŒå°Žå…¥ã•ã‚Œã¾ã—ãŸðŸŽ‰ ã“ã®æ§‹æ–‡ãƒã‚§ãƒƒã‚¯ã«ã‚ˆã£ã¦ã€æ£è¦è¡¨ç¾ã«é–“é•ã„ãŒã‚ã£ãŸå ´åˆã€äº‹å‰ã«TypeScriptãŒã‚¨ãƒ©ãƒ¼ã‚’出力ã—ã¦ãã‚Œã¾ã™ã€‚ ã“ã®æ©Ÿèƒ½ã«ã¤ã„ã¦ã€æ¬¡ã®ã“ã¨ãŒæ°—ã«ãªã£ãŸã®ã§èª¿ã¹ã¦ã¿ã¾ã—ãŸã€‚ ã©ã‚“ãªæ§‹æ–‡ãŒã‚¨ãƒ©ãƒ¼ã«ãªã‚‹ã‹ ãªãœå°Žå…¥ã•ã‚ŒãŸã‹ ã©ã†ã‚„ã£ã¦ãƒã‚§ãƒƒã‚¯ã—ã¦ã„ã‚‹ã‹ JavaScriptã§å®Ÿè¡Œã§ãã‚‹ãŒTypeScriptã§ã‚¨ãƒ©ãƒ¼ã«ãªã‚‹æ§‹æ–‡ã¯ã‚ã‚‹ã‹ ESLintã¨ã®ã‚«ãƒãƒ¼ç¯„囲ã®é•ã„ 本記事ã«é–¢ã—ã¦ã€èª¤ã‚Šç‰ãŒã‚ã‚Œã°æŒ‡æ‘˜ã„ãŸã ã‘ã‚‹ã¨å¬‰ã—ã„ã§ã™ã€‚ ã©ã‚“ãªæ§‹æ–‡ãŒã‚¨ãƒ©ãƒ¼ã«ãªã‚‹ã‹ TypeScript 5.5ã§ã¯ã€æ£è¦è¡¨ç¾ã«é–¢ã™ã‚‹ã‚¨ãƒ©ãƒ¼ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãŒ40å€‹ç¨‹åº¦è¿½åŠ ã•ã‚Œã¦ã„ã¾ã™ã€‚ 例ãˆã°ã€ä¸‹è¨˜ã®ã‚ˆã†ãªæ§‹æ–‡ã¯ã€5.5ã§ã‚¨ãƒ©ãƒ¼ã«ãªã‚Šã¾ã™ã€‚ // å˜åœ¨ã—ãªã„フラグ var re = /a/b; // エラー
JavaScriptã®Unicode Property Escapesã«ã¤ã„ã¦ã®è£œèª¬
ã“ã®è‰²ã®2ã¤ã¯Unicode 15.0.0ã§å°Žå…¥ã•ã‚ŒãŸã“ã¨ã«ä¼´ã„ã€ECMAScript 2023ã§è¿½åŠ ã•ã‚Œã‚‹è¦‹è¾¼ã¿ã§ã™ã€‚ ã“ã®è‰²ã®5ã¤ã¯Unicode 14.0.0ã§å°Žå…¥ã•ã‚ŒãŸã“ã¨ã«ä¼´ã„ã€ECMAScript 2022ã§è¿½åŠ ã•ã‚ŒãŸã‚‚ã®ã§ã™ã€‚ ã“ã®è‰²ã®4ã¤ã¯Unicode 13.0.0ã§å°Žå…¥ã•ã‚ŒãŸã“ã¨ã«ä¼´ã„ã€ECMAScript 2021ã§è¿½åŠ ã•ã‚ŒãŸã‚‚ã®ã§ã™ã€‚ Hiraganaã¨Katakanaã¯ã‚ã‚‹ã®ã«KanjiãŒãªã„ã¨æ€ã‚れるã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãŒã€Han (Hani) ã¨ã„ã†ã®ãŒæ¼¢å—ã®ã“ã¨ã§ã™ï¼ˆã€Œæ¼¢å—ã€ã®ä¸å›½èªžèªã¿ã‚’ãƒãƒ¼ãƒžå—化ã—ãŸHanziã«ç”±æ¥ï¼‰ã€‚ Unicodeã®ãƒ‡ãƒ¼ã‚¿ãƒ•ã‚¡ã‚¤ãƒ«ä¸ã«ã¯æ™‚折Katakana_Or_Hiragana (Hrkt) ã¨ã„ã†ã‚¹ã‚¯ãƒªãƒ—トåãŒå‡ºã¦ãã‚‹ã“ã¨ãŒã‚ã‚Šã¾ã™ãŒã€ã“ã‚Œã¯åˆæœŸã®é ƒã«ä½¿ã‚ã‚Œã¦ã„ãŸã‚‚ã®ã®ç¾åœ¨ã¯ã©ã®ã‚³ãƒ¼ãƒ‰ãƒã‚¤ãƒ³ãƒˆã¨ã‚‚çµã³ä»˜ã‘られã¦ã„ã¾ã›ã‚“（UAX #44ä¸
ã¯ã˜ã‚ã« - 作ã£ã¦å¦ã¶æ£è¦è¡¨ç¾ã‚¨ãƒ³ã‚¸ãƒ³
ã¯ã˜ã‚ã« æ£è¦è¡¨ç¾ã¯æ§˜ã€…ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ã€ãƒ†ã‚スト処ç†ã®ãŸã‚ã®ãƒ‘ターン言語ã§ã™ã€‚ æ£è¦è¡¨ç¾ã¯ãƒ†ã‚ストエディタã§ã®æ¤œç´¢ã‚„ç½®æ›ã€å…¥åŠ›æ–‡å—列ã®ãƒãƒªãƒ‡ãƒ¼ã‚·ãƒ§ãƒ³ãªã©ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®æ§˜ã€…ãªåˆ†é‡Žã§å®Ÿç”¨ã•ã‚Œã¦ã„ã¾ã™ã€‚ ã‚る程度ã®è¦æ¨¡ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã«ãŠã„ã¦ã€æ£è¦è¡¨ç¾ã‚’å…¨ã利用ã—ãªã„ (利用ã—ã¦ã„ãªã„) ã¨ã„ã†ã“ã¨ã¯ã»ã¨ã‚“ã©ç„¡ãã€æ£è¦è¡¨ç¾ã¯ä»Šæ—¥ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«ãŠã„ã¦éžå¸¸ã«é‡è¦ãªãƒ‘ーツã ã¨è¨€ãˆã¾ã™ã€‚ JavaScriptã‚„Rubyã¨ã„ã£ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã¯æ£è¦è¡¨ç¾ã¯ãƒ•ã‚¡ãƒ¼ã‚¹ãƒˆã‚¯ãƒ©ã‚¹ã®ãƒªãƒ†ãƒ©ãƒ«ã¨ã—ã¦å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹ãŸã‚ã€ã¨ã¦ã‚‚ç°¡å˜ã«åˆ©ç”¨ã§ãã¾ã™ã€‚ 例ãˆã°æ¬¡ã®Rubyプãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã§ã¯å¤‰æ•°fooã«å…¥ã£ãŸæ–‡å—列ã®éƒ¨åˆ†ã«fizzã‹buzzãŒå«ã¾ã‚Œã‚‹ã‹ã©ã†ã‹ã‚’ã€æ£è¦è¡¨ç¾/fizz|buzz/を使ã£ã¦ãƒã‚§ãƒƒã‚¯ã—ã¦ã„ã¾ã™ã€‚ foo =~ /fizz|buzz/ ã•ã‚‰ã«ã€è¨ˆç®—æ©Ÿç§‘å¦ (コンピューターサイエ
A comprehensive guide to the dangers of Regular Expressions in JavaScript
I first heard about regular expression denial of service (ReDoS) vulnerabilities from GitHub's Dependabot. Several of my projects over the years have had dependencies that suffered from ReDoS vulnerabilities, and I would bet that if you've built any JavaScript project with dependencies, you've also come across this. This got me thinking; if there are vulnerable regular expressions in our dependenc
The ultimate JavaScript regex guide
The string is arguably the most essential data type in programming — every programming language and software in the world uses strings in one way or another. It enables humans to easily communicate with sophisticated programs and machines. One thing that would help you a lot as a programmer is understanding how to use and manipulate strings so that you can build programs users love. Regular expres
GitHub - pemistahl/grex-js: A JavaScript / WebAssembly library for generating regular expressions from user-provided test cases
grex is a library that is meant to simplify the often complicated and tedious task of creating regular expressions. It does so by automatically generating a single regular expression from user-provided test cases. The resulting expression is guaranteed to match the test cases which it was generated from. This project has started as a Rust port of the JavaScript tool regexgen written by Devon Govet
JSã®ã‚¦ã‚§ãƒ–フレームワークã§é«˜é€Ÿãªãƒ«ãƒ¼ã‚¿ãƒ¼ã‚’実装ã™ã‚‹æ–¹æ³•
https://nseg.connpass.com/event/251366/ ã§ã®ç™ºè¡¨è³‡æ–™ã§ã™ã€‚
ランã‚ング
ランã‚ング
メンテナンス
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
RegExp Equivalence Checker
GitHub - slevithan/oniguruma-to-es: 👹 Convert patterns from Oniguruma (the regex flavor used by Ruby, TextMate grammars, etc.) to native JavaScript RegExp
GitHub - le0pard/re2js: RE2JS is the JavaScript port of RE2, a regular expression engine that provides linear time matching
GitHub - antfu/oniguruma-to-js: Covert Oniguruma-flavor Regexp to JavaScript native RegExp.
GitHub - slevithan/regex: JS regexes âž• future. A template tag for readable, high-performance, native JS regexes with extended syntax, context-aware interpolation, and always-on best practices.
JavaScriptã§å¹³ä»®å(ã²ã‚‰ãŒãª)を判定ã™ã‚‹ - Qiita
JavaScript ä¸ RegExp 與å—串å–代的神奇特性
allow escape for more characters in u not just v? · Issue #27 · tc39/proposal-regexp-v-flag
GitHub - unjs/magic-regexp: A compiled-away, type-safe, readable RegExp alternative
GitHub - tc39/proposal-regexp-atomic-operators
Random String Generator
{{#tags}}- {{label}}
{{/tags}}