BURS Automata Generation

Abstract

A simple and efficient algorlthm for generating bottom-up rewrite system (BURS) tables 1s described. A small code-generator generator Implementation produces BURS tables efficiently, even for complex instruction set descriptions The algorlthm does not reqrure novel data structures or cornphcated algorithmic techniques Previously publmhed methods for on-the-fly ellmmatlon of states are generahzed and simphfied to create a new method, tmangle trzmmzng, that is employed m the algorlthm A prototype Implementation, burg, generates BURS tables very efficiently. © 1995, ACM. All rights reserved.