Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7430055> ?p ?o }
Showing triples 1 to 42 of
42
with 100 triples per page.
- Q7430055 subject Q8217390.
- Q7430055 abstract "In computer science, scannerless parsing (also called lexerless parsing) refers to performing both tokenization (breaking a stream of characters into words) and parsing (arranging the words into phrases) in a single step, rather than breaking it up into a pipeline of a lexer followed by a parser, executing concurrently. It also refers to the associated grammar: using a single formalism to express both the lexical (word level) grammar and phrase level grammar used to parse a language.Dividing processing up into a lexer followed by a parser is generally viewed as better design because it is more modular, and scannerless parsing is primarily used when a clear lexer–parser distinction is unneeded or unwanted. Examples of when this is appropriate include TeX, most wiki grammars, makefiles, simple per application scripting languages, and Perl 6.".
- Q7430055 wikiPageExternalLink download;jsessionid=B3D73306BB171512ECD3EBF8BCB110C5?doi=10.1.1.37.7828&rep=rep1&type=pdf.
- Q7430055 wikiPageExternalLink dparser.sourceforge.net.
- Q7430055 wikiPageExternalLink laja.sourceforge.net.
- Q7430055 wikiPageExternalLink pyparsing.wikispaces.com.
- Q7430055 wikiPageExternalLink JSGLR.
- Q7430055 wikiPageExternalLink SGLR.
- Q7430055 wikiPageWikiLink Q1159631.
- Q7430055 wikiPageWikiLink Q1192029.
- Q7430055 wikiPageWikiLink Q128392.
- Q7430055 wikiPageWikiLink Q15777.
- Q7430055 wikiPageWikiLink Q16210054.
- Q7430055 wikiPageWikiLink Q171.
- Q7430055 wikiPageWikiLink Q1760114.
- Q7430055 wikiPageWikiLink Q187432.
- Q7430055 wikiPageWikiLink Q1917459.
- Q7430055 wikiPageWikiLink Q194152.
- Q7430055 wikiPageWikiLink Q2052676.
- Q7430055 wikiPageWikiLink Q20748783.
- Q7430055 wikiPageWikiLink Q21198.
- Q7430055 wikiPageWikiLink Q2165493.
- Q7430055 wikiPageWikiLink Q2311085.
- Q7430055 wikiPageWikiLink Q3429683.
- Q7430055 wikiPageWikiLink Q373045.
- Q7430055 wikiPageWikiLink Q4654216.
- Q7430055 wikiPageWikiLink Q4943356.
- Q7430055 wikiPageWikiLink Q5301.
- Q7430055 wikiPageWikiLink Q6715473.
- Q7430055 wikiPageWikiLink Q6822435.
- Q7430055 wikiPageWikiLink Q7169108.
- Q7430055 wikiPageWikiLink Q729271.
- Q7430055 wikiPageWikiLink Q7424035.
- Q7430055 wikiPageWikiLink Q7430054.
- Q7430055 wikiPageWikiLink Q752532.
- Q7430055 wikiPageWikiLink Q7590386.
- Q7430055 wikiPageWikiLink Q7671308.
- Q7430055 wikiPageWikiLink Q7777054.
- Q7430055 wikiPageWikiLink Q8217390.
- Q7430055 wikiPageWikiLink Q835922.
- Q7430055 comment "In computer science, scannerless parsing (also called lexerless parsing) refers to performing both tokenization (breaking a stream of characters into words) and parsing (arranging the words into phrases) in a single step, rather than breaking it up into a pipeline of a lexer followed by a parser, executing concurrently.".
- Q7430055 label "Scannerless parsing".