Context-Free Grammars (CFGs) in Theoretical Computer Science (TOC) are formal grammars that describe the syntax and structure of context-free languages. They are widely used for parsing and generating the syntax of programming languages, natural languages, and many other formal language applications.