Fixed link.

diff --git a/src/examples/example_02.rst b/src/examples/example_02.rst
index 66501cf2305a28d6f82e68d46433e84ceccf1ca0..426e0519396b100a8a867d5780e37f86bd764e1c 100644 (file)
--- a/src/examples/example_02.rst
+++ b/src/examples/example_02.rst
@@ -25,7 +25,7 @@ If the check fails, lexer calls ``YYFILL(n)``, which can either supply at least
 
 For those interested in the internal re2c algorithm used to determine checkpoints,
 here is a quote from the original paper
-`"RE2C: a more versatile scanner generator" <1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`_
+`"RE2C: a more versatile scanner generator" <../about/1994_bumbulis_cowan_re2c_a_more_versatile_scanner_generator.pdf>`_
 by Peter Bumbulis, Donald D. Cowan, 1994, ACM Letters on Programming Languages and Systems (LOPLAS):
 
     *A set of key states can be determined by discovering the strongly-connected components (SCCs) of the