Parsing is one of the foundational problems in the field of programming languages. While the theory of parsing with context free grammars is well understood, parsing more complex languages remains a hard problem. Indentation-sensitive languages are an important subset of languages that have been studied extensively. We build on both Adams’ work of indentation-sensitive parsing and Caballero et al.’s work on functional logic parsing to show how functional logic languages can elegantly solve the problem of indentation-sensitive parsing.