LOGCFL
In computational complexity theory , LOGCFL is the complexity class that contains all decision problems that can be reduced in logarithmic space to a context-free language . 
<triplet> LOGCFL <subj> complexity class <obj> instance of <triplet> complexity class <subj> computational complexity theory <obj> part of <triplet> logarithmic space <subj> complexity class <obj> instance of