picoparsecA fast and flexible parser combinator library, accepting any input type that is an instance of an appropriate monoid subclass. [Skip to Readme]
GitHub - kontan/Parsect: Parser Combinator for TypeScript
Parsect is a parser combinator library for TypeScript or JavaScript. It provides a easy way to write a readable parser in only TypeScript/JavaScript without any other domain-specific languages like yacc/lex, ANTLR or PEG.js. Parsect can be used from not only TypeScript and JavaScript but also other AltJSs. I got the idea for Parsect from Parsec parser combinator library in Haskell, however this is
LTSV ブームã«ã®ã£ã‹ã£ã¦ Scala ã®ãƒ‘ーサーを書ãã¾ã—㟠- seratch's weblog in Japanese
「Scala ãªã‚‰ãã‚Œ parser combinator ã§ã§ãるよã€ã¨ã„ã†ã“ã¨ã§ãƒ‘ーサーを書ãã¾ã—ãŸã€‚ https://github.com/seratch/ltsv4s ã‚‚ã£ã¨åž‹ã«ãƒžãƒƒãƒ”ングã—ãŸããªã‚‹æ°—ã‚‚ã—ã¾ã™ãŒã€ç›®çš„ã¯ä¸»ã«ãƒã‚°ã®ãƒ‘ースã§ã™ã—ã€ã¾ãšã¯ Map ã¨ã‹ã§ã‚ˆã„ã®ã§ã¯ã¨ã„ã†æ„Ÿã˜ã«ãªã£ã¦ã„ã¾ã™ã€‚ 一行èªã¿è¾¼ã‚€ parseLine ã¨è¤‡æ•°è¡Œã‚’èªã‚€ parseLines ã®äºŒç¨®é¡žãŒã‚ã‚Šã¾ã™ãŒã€åŸºæœ¬çš„ã«ã¯ãƒã‚°ãƒ•ã‚¡ã‚¤ãƒ«ã‚’ Stream ãªæ„Ÿã˜ã§èªã¿ãªãŒã‚‰ä¸€è¡Œãšã¤ parseLine ã§å‡¦ç†ã™ã‚‹ã®ã‹ãªã¨æ€ã„ã¾ã™ã€‚ scala> import com.github.seratch.ltsv4s._ import com.github.seratch.ltsv4s._ scala> val log: Map[String, String] = LTSV.parseLine("field1:v
Scala ã® Parser を試ã—ãŸã‚‰ãƒãƒžã£ãŸã®ã§ã¾ã¨ã‚ã¦ãŠã。 - å見プãƒã‚°ãƒ©ãƒžã®èªžã‚Šï¼
以å‰ã€Scala ã® Parser を試ã—ãŸã‚“ã§ã™ãŒãƒãƒžã£ã¦ã—ã¾ã£ãŸã®ã§ã€ãƒãƒžã‚Šè¨˜å¿µã¨ã„ã†ã“ã¨ã§è¨˜äº‹ã«ã—ã¦ãŠã“ã†ã¨æ€ã„ã¾ã™ã€‚ ã¡ãªã¿ã«ã€Scala ã®ãƒ‘ーサコンビãƒãƒ¼ã‚¿ã«ã¤ã„ã¦çŸ¥ã‚ŠãŸã„人ã¯åƒ•ã®ã“ã®è¨˜äº‹ã‚ˆã‚Šã‚‚ @kmizu ã•ã‚“ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã‚’èªã‚“ã æ–¹ãŒè‰¯ã„よã†ã«æ€ã„ã¾ã™ã€‚ â– Scala ã®ãƒ‘ãƒ¼ã‚µæ¦‚è¦ ã¾ãš import ã—ã¦ãŠããŸã„ã®ã¯ scala.util.parsing.combinator.Parsers ã§ã™ã€‚ 主ãªæ‰‹é †ã¯æ¬¡ã®é€šã‚Šã€‚ １．Parsers オブジェクトを作る。 ２．Parsers.Parser[ Result ] ã®ã‚ªãƒ–ジェクトを作る。ã“ã“㧠Result ã¯ãƒ‘ースçµæžœã®åž‹ã€‚ ３．２．ã§ä½œã£ãŸã‚ªãƒ–ジェクトã«ãƒ‘ース対象ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã‚ªãƒ–ジェクトを渡ã™ã€‚ ４．３．ã®çµæžœå¾—られるもã®ãŒãƒ‘ースçµæžœã€‚ â– ç°¡å˜ãªãƒˆã‚³ã‹ã‚‰ã„ãã¾ã—ょ ã¾ãš Char ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã‚’èªã‚“㧠MyData
Scalaã®RegexParsersを使ã£ã¦ã¿ã‚‹ | mwSoft
普通ã®æ£è¦è¡¨ç¾ã‚’実行ã—ã¦ã¿ã‚‹ ã„ããªã‚Šãƒ‘ーサを書ãã®ã¯ãƒãƒ¼ãƒ‰ãƒ«ãŒé«˜ãã†ãªã®ã§ã€ã¨ã‚Šã‚ãˆãšæ•°å€¤ã ã‘を許å¯ã™ã‚‹æ£è¦è¡¨ç¾ã‚’å‹•ã‹ã—ã¦ã¿ã‚‹ã€‚ 下記ã¯ã€æ•°å€¤æ–‡å—列を渡ã›ã°ãã®ã¾ã¾æ–‡å—列を返ã—ã€æ•°å€¤ä»¥å¤–ã®æ–‡å—列を渡ã™ã¨ä¾‹å¤–ã«ãªã‚‹å‡¦ç†ã«ãªã‚‹ã€‚ class SimpleRegex1 extends RegexParsers { def re = "[0-9]+".r def parse(input: String) = parseAll(re, input) } val result = new SimpleRegex1().parse("130") println(result.get) //=> 130 数値以外を渡ã—ãŸå ´åˆã¯ä¸‹è¨˜ã®ã‚ˆã†ãªä¾‹å¤–ã«ãªã‚‹ã€‚ val result = new Sample().parse("abc") println(result.get) //=> java.lang.Run
第18回 Scalaã¨ãƒ‘ーザコンビãƒãƒ¼ã‚¿ï¼ˆå®Ÿè£…編）
ç‘波大å¦ç¬¬ä¸‰å¦ç¾¤æƒ…å ±å¦é¡žã‚’å’æ¥ã—ãŸã®ã¡ã€ç¾åœ¨ã¯ã€ç‘波大å¦å¤§å¦é™¢ã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”究科コンピュータサイエンス専攻åšå£«å¾ŒæœŸèª²ç¨‹3年。プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚„処ç†ç³»ã«å¼·ã„興味をæŒã£ã¦ã„る。ç¾åœ¨ã®ç ”究テーマã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®æ§‹æ–‡è§£æžã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 。Scala勉強会をä¸å®šæœŸã§è¡Œã†ãªã©ã€ç ”究ã®åˆé–“ã«Scalaã®æ™®åŠæ´»å‹•ã‚’è¡Œã£ã¦ã„る。 Scalaã«ã¯ãƒ‘ーザコンビãƒãƒ¼ã‚¿ãƒ©ã‚¤ãƒ–ラリã¨ã„ã†ã€æ§‹æ–‡è§£æžã‚’è¡Œã†ãŸã‚ã®å°‚用ライブラリãŒå˜åœ¨ã—ã¾ã™ã€‚今回ã¯ã€å‰å›žã«èª¬æ˜Žã—ãŸHello, World!パーザをより簡潔ã«æ›¸ã‘るよã†ã«ä¿®æ£ã—ã¦ã„ãã»ã‹ã€JSONã®ã‚µãƒ–セットã®ãƒ‘ーザã®å®Ÿè£…ã¾ã§ã‚’解説ã—ã¾ã™ã€‚ Hello, World!パーザを改良ã—ã¦ã¿ã‚‹ strメソッド - æ–‡å—列を直接扱ãˆã‚‹ã‚ˆã†ã« å‰å›žèª¬æ˜Žã—ãŸãƒªã‚¹ãƒˆ5ã®ãƒ‘ーザã¯ã€ãƒ—リミティブã¨ã—ã¦1æ–‡å—ã«ãƒžãƒƒãƒã™ã‚‹ãƒ‘ーザã—ã‹æ‰±ãˆãªã‹ã£ãŸãŸã‚ã€ã„ã¡ã„ã¡ãれを~ã§ã¤ãªã„ã§ã„ãã®ãŒé¢å€’
第17回 Scalaã¨ãƒ‘ーザコンビãƒãƒ¼ã‚¿ï¼ˆåŸºæœ¬ç·¨ï¼‰
ç‘波大å¦ç¬¬ä¸‰å¦ç¾¤æƒ…å ±å¦é¡žã‚’å’æ¥ã—ãŸã®ã¡ã€ç¾åœ¨ã¯ã€ç‘波大å¦å¤§å¦é™¢ã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”究科コンピュータサイエンス専攻åšå£«å¾ŒæœŸèª²ç¨‹3年。プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã‚„処ç†ç³»ã«å¼·ã„興味をæŒã£ã¦ã„る。ç¾åœ¨ã®ç ”究テーマã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®æ§‹æ–‡è§£æžã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 。Scala勉強会をä¸å®šæœŸã§è¡Œã†ãªã©ã€ç ”究ã®åˆé–“ã«Scalaã®æ™®åŠæ´»å‹•ã‚’è¡Œã£ã¦ã„る。 Scalaã«ã¯ãƒ‘ーザコンビãƒãƒ¼ã‚¿ãƒ©ã‚¤ãƒ–ラリã¨ã„ã†ã€æ§‹æ–‡è§£æžã‚’è¡Œã†ãŸã‚ã®å°‚用ライブラリãŒå˜åœ¨ã—ã¾ã™ã€‚パーザコンビãƒãƒ¼ã‚¿ãƒ©ã‚¤ãƒ–ラリを使ã†ã“ã¨ã§ã€ç‰¹å®šã®ç”¨é€”ã«ç‰¹åŒ–ã—ãŸè¨å®šãƒ•ã‚¡ã‚¤ãƒ«ã‚„DSLã®ãƒ‘ーザを手書ãã§æ›¸ãよりも簡å˜ã«æ›¸ã‘るよã†ã«ãªã‚Šã¾ã™ã€‚ 本記事ã§ã¯ã€Scalaã®ãƒ‘ーザコンビãƒãƒ¼ã‚¿ãƒ©ã‚¤ãƒ–ラリã®åŸºæœ¬çš„ãªä½¿ã„æ–¹ã‹ã‚‰ã€ãƒ‘ーザコンビãƒãƒ¼ã‚¿ã‚’使ã£ãŸJSONã®ã‚µãƒ–セットã®ãƒ‘ーザã®å®Ÿè£…ã¾ã§ã‚’解説ã—ã¾ã™ã€‚構文解æžã®å®Ÿè£…手法ã«é–¢ã™ã‚‹çŸ¥è˜ã¯å‰æã¨ã—ã¾ã›ã‚“ãŒã€æ§‹æ–‡è§£æžã¨ã¯ã©ã®ã‚ˆã†ãªã‚‚ã®ã‹ã€ã¨ã„ã†
Parsec æ¡ä»¶ä¸€è‡´ã—ãŸè¡Œã‚’無視 - Faith and Brave - C++ã§éŠã¼ã†
ã¡ã‚‡ã£ã¨ã—ãŸãƒã‚°è§£æžã«Haskellã®Parsecを使ã£ã¦ã¾ã—ãŸã€‚ 「行ã«ç‰¹å®šã®æ–‡å—列ãŒå«ã¾ã‚Œã¦ã„ãŸã‚‰ç„¡è¦–ã™ã‚‹ã€ã¨ã„ã†ã‚ˆãã‚ã‚‹ç°¡å˜ãªãƒ•ã‚£ãƒ«ã‚¿å‡¦ç†ã§ã™ã€‚C++ã®Boost.Spirit.Qiã§ã‚れ㰠*(qi::char_ - "[condition]") ã®ã‚ˆã†ã«æ›¸ã処ç†ã€‚ã“れをParsecã§ã‚„ã‚‹ã«ã¯ã€manyTillを使ãˆã°ã„ã„よã†ã§ã™ã€‚ import Text.Parsec import Text.Parsec.String parseText :: Parser () parseText = do manyTill anyChar (try (string "[condition]")) return () isIgnore :: String -> Bool isIgnore s = case (parse parseText "" s) of Left _ -> False Ri
Using text.parsec.indent to Parse an Indentation-Sensitive Language with Haskell's Parsec Library
Using text.parsec.indent to Parse an Indentation-Sensitive Language with Haskell’s Parsec Library I’ve been working on a toy language with Job Vranish. We decided that we wanted to use indentation to represent blocking instead of braces (like Python). We’re implementing our toy in Haskell using the Parsec parser-combinator library. Luckily, there’s a companion library that handles indentation pars
variadic.me - variadic リソースãŠã‚ˆã³æƒ…å ±
This webpage was generated by the domain owner using Sedo Domain Parking. Disclaimer: Sedo maintains no relationship with third party advertisers. Reference to any specific service or trade mark is not controlled by Sedo nor does it constitute or imply its association, endorsement or recommendation.
Haskell 㧠parser を書ãã«ã¯ (åˆå¿ƒè€…ç·¨)
Haskell 㧠parser を書ãã«ã¯ (åˆå¿ƒè€…ç·¨) å‹æ‰‹ã« Haskell Advent Calendar 2011 Haskell Advent Calendar 2011 ã«ã¯ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã§ãã¾ã›ã‚“ã§ã—ãŸã‘ã©ã€ä¸€äººå¯‚ã—ã「å‹æ‰‹ã« Haskell Advent Calendar 2011ã€ã‚’開催ã—ã¦ã€ã‚ãã‚ãクリスマスを待ã¡ãŸã„ã¨æ€ã„ã¾ã™ã€‚ 目的: Parsec3 㨠attoparsec ã®åŸºæœ¬çš„使用法, Applicative スタイルを習得ã™ã‚‹ å‰ç½®ã: Haskell 㧠parser を書ãã«ã¯ã©ã†ã™ã‚Œã°ã„ã„ã®ã§ã—ょã†ã‹? ç§ã¯ã€ã“れを勉強ã™ã¹ãæƒ…å ±æºã‚’探ã—ã¾ã—ãŸãŒã€ä¸€ä½“ã©ã“ã‹ã‚‰ã©ã†å§‹ã‚ã‚Œã°ã„ã„ã®ã‹åˆ†ã‹ã‚‰ãšã€éžå¸¸ã«æ··ä¹±ã—ã¾ã—ãŸã€‚「ã“ã®è¨˜äº‹ã‚’èªã‚ã°å¤§ä½“概è¦ãŒå…¨éƒ¨åˆ†ã‹ã‚‹ã€ã¨ã„ã†æƒ…å ±æºãŒæ—¥æœ¬èªžã§ã‚‚英語ã§ã‚‚見ã¤ã‘られãªã‹ã£ãŸã‹ã‚‰ã§ã™ã€‚ãªã®ã§è‡ªåˆ†ã§ã¾ã¨ã‚ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚ (ç§
Parsing context-sensitive languages with Applicative
Many parser combinator libraries in Haskell (such as parsec) have both a Monad interface as well as an Applicative interface. (Actually, to be really useful, you also need MonadPlus along with Monad, or Alternative along with Applicative, in order to encode choice; from now on when I talk about Monad and Applicative note that I really have MonadPlus or Alternative in mind as well.) The Applicative
Programming Haskell Chapter8
The document describes how to build a parser for Backus-Naur Form (BNF) grammars in Haskell using the attoparsec parsing library. It defines types and parsers to represent BNF syntax, rules, expressions, lists and terms. The parsers use functions like spaces, string, text from attoparsec to parse individual components and combine them using operators like <*>, <|> to build up the full BNF grammar
Text Manipulation with/without Parsec
This document summarizes a presentation on text manipulation in Haskell using the parsec and attoparsec libraries. It discusses splitting strings, designing a split function recursively and with parsec, and comparing the parsec and attoparsec parsing libraries. It also covers the different text types in Haskell - String, ByteString, and Text - and when each would be used.Read less
Planck ã¨ã„ㆠmonadic parser combinator を公開ã—ã¾ã—㟠- camlspotter’s blog
Planck: A Small Parser Combinator Library for OCaml I have released Planck, a small monadic parser combinators for OCaml. It includes a proof of implementation: OCaml syntax lexer and a parser which create 100% identical AST as the original OCaml's lex+yacc, and available at https://bitbucket.org/camlspotter/planck . http://camlspotter.blogspot.com/2011/05/planck-small-parser-combinator-library.ht
Haskellã®Language.Java.*を試ã—ã¦ã¿ãŸ - khibino blog
Haskell Advent Calendar ã®ãŸã‚ã®ã‚¨ãƒ³ãƒˆãƒªã§ã™ã€‚ Haskellã®ãƒ©ã‚¤ãƒ–ラリã§language-javaã¨ã„ã†ã‚‚ã®ã‚’見ã¤ã‘ãŸã®ã§ã”紹介ã§ã™ã€‚ 仕事ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã§Javaã®ã‚³ãƒ¼ãƒ‰ç”Ÿæˆã‚’è¡Œãªã£ã¦ã„ã‚‹ã‚‚ã®ãŒã‚ã‚Šã€ç¾çŠ¶ã§ã¯ãƒ†ãƒ³ãƒ—レートを穴埋ã‚ã™ã‚‹ã‚ˆã†ãªå‡¦ç†ã‚’Perlã§è¡Œãªã£ã¦ã„ã¾ã™ã€‚ ã—ã‹ã—ã„ã‚ã„ã‚ã¨è¦æ±‚ãŒè¤‡é›‘ã«ãªã£ã¦ãã‚‹ã¨ã€ç©´åŸ‹ã‚処ç†ã®ã¾ã¾ã§ã¯Javaã®ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰å†…ã®æ„味ã®æ•´åˆã‚’ç¶æŒã™ã‚‹ã®ãŒæ¬¡ç¬¬ã«é¢å€’ã«ãªã‚Šã€ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã®æ§‹é€ ã‚’æ„è˜ã—ãŸå‡¦ç†ã«ç½®ãæ›ãˆãŸããªã£ã¦ãã¾ã—ãŸã€‚ Haskellã«ã¯ãã®ã‚ˆã†ãªã‚³ãƒ¼ãƒ‰ç”Ÿæˆå‘ã‘ライブラリãŒç„¡ã„ã ã‚ã†ã‹ã¨æŽ¢ã—ã¦ã¿ãŸã®ãŒãã£ã‹ã‘ã§ã—ãŸã€‚ http://hackage.haskell.org/package/language-java/ ç¾çŠ¶ã ã¨4ã¤ã®ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚’å«ã‚“ã§ã„ã¾ã™ã€‚ ãã‚Œãžã‚Œã€javaã®ãƒ¬ã‚サ (Language.Java.Lex
ãŠçŸ¥ã‚‰ã›
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
GitHub - ekmett/trifecta: Parser combinators with highlighting, slicing, layout, literate comments, Clang-style diagnostics and the kitchen sink
Trifecta / Parsers
How to test if Scala combinator parser matches a string
GitHub - fab13n/parsec-coffee-script
{{#tags}}- {{label}}
{{/tags}}