Fast Deterministic Black-Box Context-Free Grammar Inference

Black-box context-free grammar inference is a hard problem as in many practical settings it only has access to a limited number of example programs. The state-of-the-art approach Arvada heuristically generalizes grammar rules starting from flat parse trees and is non-deterministic to explore differe...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / International Conference on Software Engineering s. 1434 - 1445
Hlavní autori:	Arefin, Mohammad Rifat, Shetiya, Suraj, Wang, Zili, Csallner, Christoph
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	ACM 14.04.2024
Predmet:	bracket-implied nesting structure Closed box deterministic synthesis Grammar Grammar inference nested language concepts oracle Runtime Source coding Training data
ISSN:	1558-1225
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!