The CYK (Cocke-Younger-Kasami) algorithm is a well-known parsing algorithm for context-free grammars that can parse strings in cubic time. It is particularly used for parsing grammar given in Chomsky Normal Form (CNF), making it both a classic and efficient choice for parsing context-free languages.