You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The CFL Reachability problem involves determining whether there is a path in a graph where the concatenation of edge labels along the path forms a string that belongs to a given context-free language.
[Ranked No. 1🥇] My solution for the course project of Parallel Computing 2021'Spring @ BUAA (北航并行程序设计). Plenty of C++ tricks, hacks, and optimizations are used for extreme efficiency. Ranked *1/100* in the efficiency test.
C++ code to implement CYK algorithm with given Context Free Grammar in Chomsky Normal Form and input string. This code also prints all possible parse trees for the input string even if the grammar is ambigous.