解析表現文法
1. Parsing expression grammarIn computer science, a parsing expression grammar, or PEG, is a type of analytic formal grammar, i.e. it describes a formal language in terms of a set of rules for recognizing strings in the language. The formalism was introduced by Bryan Ford in 2004 and is closely related to the family of top-down parsing languages introduced in the early 1970s. Syntactically, PEGs also look similar to context-free grammars (CFGs), but they have a different interpretation: the rules of PEGs are ordered.
Read “Parsing expression grammar” on English Wikipedia
Read “解析表現文法” on Japanese Wikipedia
Read “Parsing expression grammar” on DBpedia
Read “Parsing expression grammar” on English Wikipedia
Read “解析表現文法” on Japanese Wikipedia
Read “Parsing expression grammar” on DBpedia
Discussions
Log in to talk about this word.