Open AccessAlgorithms of analyzing left context terminal grammars used for automated programs testing
Author(s) -
Andrey Stankevich
Publication year - 2014
Publication title -
spiiras proceedings
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 9
eISSN - 2078-9599
pISSN - 2078-9181
DOI - 10.15622/sp.13.5
Subject(s) - rule based machine translation , context free grammar , computer science , l attributed grammar , programming language , equivalence (formal languages) , tree adjoining grammar , scripting language , context sensitive grammar , extended affix grammar , parsing expression grammar , stochastic context free grammar , terminal (telecommunication) , natural language processing , algorithm , mathematics , discrete mathematics , telecommunications
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom