Fast deterministic parsers for transition networks
Sign Up to like & getrecommendations! Published in 2017 at "Acta Informatica"
DOI: 10.1007/s00236-017-0308-3
Abstract: Extended BNF grammars (EBNF) allow regular expressions in the right parts of their rules. They are widely used to define languages, and can be represented by recursive Transition Networks (TN) consisting of a set of… read more here.
Keywords: shift; transition networks; parsers transition; deterministic parsers ... See more keywords