This lecture covers the structure of a project aimed at solving WS1S formulas, including the input/output process, internal representation, solving algorithm, and planned additions such as macros, first-order variables, natural numbers representation, and succ operators.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.
