English LOGCFL Cited by user David Eppstein on 28 Mar 2024 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.