From 7109c7aaf38a1e2c60791312b16d41d2a1b3b7c9 Mon Sep 17 00:00:00 2001 From: Lucas Wiman Date: Sun, 26 Feb 2017 00:45:57 -0800 Subject: [PATCH] Fix inadequate ` --- README.rst | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.rst b/README.rst index c46b1a5..af28763 100644 --- a/README.rst +++ b/README.rst @@ -25,7 +25,7 @@ Installation Usage Examples -------------- -Consider the language of strings on the alphabet `abc`, which begin with b and have length congruent to 10 mod 15. This can be represented as follows: +Consider the language of strings on the alphabet ``abc``, which begin with b and have length congruent to 10 mod 15. This can be represented as follows: .. code-block:: python @@ -58,7 +58,7 @@ We can also introspect aspects of the language, and generate examples which matc >>> list(DeterministicRegularLanguageGenerator((r & compile('b(a{0,50})')).as_dfa('abc')).matching_strings_iter()) ['baaaaaaaaa', 'baaaaaaaaaaaaaaaaaaaaaaaa', 'baaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa'] -`RandomRegularLanguageGenerator.generate_string(n)` will choose a string of length n *uniformly at random* among strings of length `n` matched by the regular expression. For example, consider the following regular expression, which matches comma-separated lists of numbers 01-20: +``RandomRegularLanguageGenerator.generate_string(n)`` will choose a string of length ``n`` *uniformly at random* among strings of length ``n`` matched by the regular expression. For example, consider the following regular expression, which matches comma-separated lists of numbers 01-20: .. code-block:: python