Parasitic gap is one of the interesting topics in syntactic literature since its existence depends on a real gap in the sentences. Both English and Korean have parasitic gap constructions, but their syntactic behaviors are a little different. Lee (2010b) discussed how parasitic gap constructions in these two languages are different and provided Combinatory Categorial Grammar (CCG) analyses for the constructions. The operation functional substitution plays an important role in the CCG analysis of the construction. The goal of this paper is to provide computational implementation based on Korean Type-inherited Combinatory Categorial Grammar (TCCG) system (Lee, 2010a), which is a combination of Steedman’s CCG and the Linguistic Knowledge Building (LKB) system. Two types of output data will be provided as outputs of the implementation. One is the syntactic parse tree, and the other is the semantic representation. In the parse trees, category combinatorics is encoded. For the semantic representations, Minimal Recursion Semantics (MRS) is adopted, and all the semantic relations are represented in the MRS structure.