A repository that describes my explorations on formal verification using Dafny, techniques from programming language theory such as CYK parsing, Earley parsing, type-theoretic things like lambda ...
The Cocke-Younger-Kasami (CYK) Algorithm is a dynamic programming algorithm used to determine whether a given string can be generated by a given context-free grammar (CFG) in Chomsky Normal Form (CNF) ...
Abstract: Through thoroughly researching on CYK-algorithm (Cocke-Younger-Kasami) parsing to normal sentence, especially on generating algorithm about initial CYK-table of word-lattice structure, and ...
Abstract: The syntax analysis phase of a Compiler is to check syntactic structure of Programming Language construct using Context Free Grammar. Either by using Top-Down or Bottom-Up parsing technique ...
Backward induction as a solution method for finite-horizon discrete-time dynamic optimization problems Method of undetermined coefficients can be used to solve the Bellman equation in infinite-horizon ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback