Zobrazeno 1 - 1
of 1
pro vyhledávání: '"syntax chart"'
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 finite-state machines. We present
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d616c4f9ee2fb3ee137a8e61273ee662
http://hdl.handle.net/11311/1120727
http://hdl.handle.net/11311/1120727
