CS 451 Programming Paradigms
Week Twelve
Lecture 23 : Tuesday, 4/11/00
- Review graph search algorithms
- Discuss importance of meta-predicates
- Present typing constraints for Prolog and how to add such constraints with meta-predicates
- Build Prolog in Prolog (meta-interpreter)
Lecture 24 : Thursday, 4/13/00
- Review concepts supporting recursive descent parsing
- Build context-free parser in Prolog
- Discuss context-sensitive parsing
- Build context-sensitive parser in Prolog
- Discuss adding further constraints for natural language semantics
- Present recursive descent semantic net parsing with inheritance
[ Back to CS451: Lecture Summaries ]