# HG changeset patch
# User Christian Urban <urbanc@in.tum.de>
# Date 1505396923 -3600
# Node ID f1cde0b6cc3027d110c12617c5c94f0ab3a095b6
# Parent  51b47eb732f925f3f67444efeae444f760a92b82
updated

diff -r 51b47eb732f9 -r f1cde0b6cc30 bsc-projects-17.html
--- a/bsc-projects-17.html	Thu Sep 14 12:51:22 2017 +0100
+++ b/bsc-projects-17.html	Thu Sep 14 14:48:43 2017 +0100
@@ -129,7 +129,8 @@
   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, Ruby and Java (and possibly in Scala too). The application would be to implement a fast lexer for
-  programming languages, or improve the network traffic analysers in the tools Snort and Bro???
+  programming languages, or improve the network traffic analysers in the tools <A HREF="https://www.snort.org">Snort</A> and
+  <A HREF="https://www.bro.org">Bro</A>.
   </p>
 
   <p>
@@ -207,7 +208,7 @@
   very optimised subsets of JavaScript that can be used for this purpose:
   one is <A HREF="http://asmjs.org">asm.js</A> and the other is
   <A HREF="https://github.com/kripken/emscripten/wiki">emscripten</A>. Since
-  last year there is even the official Webassembly???
+  last year there is even the official <A HREF="http://webassembly.org">Webassembly</A>
   There is a <A HREF="http://kripken.github.io/emscripten-site/docs/getting_started/Tutorial.html">tutorial</A> for emscripten
   and an impressive <A HREF="https://youtu.be/c2uNDlP4RiE">demo</A> which runs the
   <A HREF="http://en.wikipedia.org/wiki/Unreal_Engine">Unreal Engine 3</A>