Log Space Recognition and Translation of Parenthesis Languages

Abstract

It ISshown how to determme membership in any parenthesis context-free language in log space As an apphcanon, the evaluation of Boolean sentences IS shown to be log space computable Log space translation of parenthesis languages IS sirmlarly shown to be possible, thus log space translators among various representations of Boolean formulas may be constructed. © 1977, ACM. All rights reserved.