Path coverage is of critical importance in software testing and verification, and further, path explosion is a well-known challenge for automatic software analysis techniques like symbolic execution. Asymptotic Path Complexity (APC), is a code complexity metric that formalizes the quantitative measurement of path explosion. APC previously ignored all recursive calls which lead to under reporting when analyzing recursive functions. With the use of context free grammars and a number of newly developed algorithms, it is now possible to use \textsc{Metrinome} to accurately compute APC for recursive functions.