Optimal code from flow graphs

DOI10.1016/0096-0551(82)90020-0zbMATH Open0484.68006OpenAlexW2054520617MaRDI QIDQ3943979FDOQ3943979

Authors: M. V. S. Ramanath, Marvin Solomon 

Publication date: 1982

Published in: Computer Languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-0551(82)90020-0

zbMATH Keywords

number of jumpsunconditional jumpsif-then-else statementslinear sequence of instructions from a flow graphlinear-time algorithm for finding the optimal translation of a programrepeat-until statements

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Optimal code from flow graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3943979)