# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1474699024 -3600
# Node ID 0647d8161a84f3b3ffedd32f75e2bf4c485166d5
# Parent  3feaf8bc3e48214ec16e913ab584adb8817af7e2
updated

diff -r 3feaf8bc3e48 -r 0647d8161a84 bsc-projects-16.html
--- a/bsc-projects-16.html	Fri Sep 23 15:07:05 2016 +0100
+++ b/bsc-projects-16.html	Sat Sep 24 07:37:04 2016 +0100
@@ -59,10 +59,10 @@
   introduced in 1950 by <A HREF="http://en.wikipedia.org/wiki/Stephen_Cole_Kleene">Stephen Kleene</A>,
   you might think regular expressions have since been studied and implemented to death. But you would definitely be
   mistaken: in fact they are still an active research area. On the top of my head, I can give
-  you at least research papers that appeared in the last few years.
+  you at least ten research papers that appeared in the last few years.
   For example
   <A HREF="http://www.home.hs-karlsruhe.de/~suma0002/publications/regex-parsing-derivatives.pdf">this paper</A> 
-  about regular expression matching and derivatives was presented just last summer at the international 
+  about regular expression matching and derivatives was presented at the international 
   FLOPS'14 conference. The task in this project is to implement their results and use them for lexing.</p>
 
   <p>The background for this project is that some regular expressions are 
@@ -126,7 +126,7 @@
   about the <A HREF="http://en.wikipedia.org/wiki/Myhill–Nerode_theorem">Myhill-Nerode theorem</A>.
   So I know they are worth their money. Still, it would be interesting to actually compare their results
   with my simple rainy-afternoon matcher and potentially &ldquo;blow away&rdquo; the regular expression matchers 
-  in Python and Ruby (and possibly in Scala too). The application would be to implement a fast lexer for
+  in Python, Ruby and Java (and possibly in Scala too). The application would be to implement a fast lexer for
   programming languages. 
   </p>
 
@@ -153,7 +153,7 @@
 
   <p>
   <B>Skills:</B> 
-  This is a project for a student with an interest in theory and some
+  This is a project for a student with an interest in theory and with
   good programming skills. The project can be easily implemented
   in functional languages like
   <A HREF="http://www.scala-lang.org/">Scala</A>,
@@ -329,7 +329,8 @@
   others. If you want to avoid JavaScript there are a number of alternatives: for example the
   <A HREF="http://elm-lang.org">Elm</A>
   language has been especially designed for implementing with ease interactive animations, which would be
-  very convenient for this project.
+  very convenient for this project. A nice slide making project done by a previous student is 
+  <A HREF=" http://www.markslides.org/src/markslides.html">MarkSlides</A> by Oleksandr Cherednychenko. 
   </p>
 
 <li> <H4>[CU4] An Online Student Voting System</H4>
@@ -622,10 +623,12 @@
  I am also open to project suggestions from you. You might find some inspiration from my earlier projects:
  <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-12.html">BSc 2012/13</A>, 
  <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-12.html">MSc 2012/13</A>, 
- <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-13.html">BSc 2013/14</A>
- <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-13.html">MSc 2013/14</A> 
- <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-14.html">BSc 2014/15</A>
- <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-14.html">MSc 2014/15</A> 
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-13.html">BSc 2013/14</A>,
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-13.html">MSc 2013/14</A>, 
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-14.html">BSc 2014/15</A>,
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-14.html">MSc 2014/15</A>, 
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/bsc-projects-15.html">BSc 2015/16</A>,
+ <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/msc-projects-15.html">MSc 2015/16</A> 
 </ul>
 </TD>
 </TR>