# Does any parser ever parse non deterministic unambiguous context free grammar?

I have been informed parser parses unambiguous context free grammars of $$DCFL$$.

I was wondering if there could be a parser which could make a parsing table for unambiguous grammars of $$NCFL$$?

Note: This has been discussed here briefly in comments.