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...

Full description

Bibliographic Details

Published in:	Proceedings / International Conference on Software Engineering pp. 1434 - 1445
Main Authors:	Arefin, Mohammad Rifat, Shetiya, Suraj, Wang, Zili, Csallner, Christoph
Format:	Conference Proceeding
Language:	English
Published:	ACM 14.04.2024
Subjects:	bracket-implied nesting structure Closed box deterministic synthesis Grammar Grammar inference nested language concepts oracle Runtime Source coding Training data
ISSN:	1558-1225
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!