Naming.

Author: katef

README.md

@@ -4,12 +4,15 @@
     ; re -cb -pl dot '[Ll]ibf+(sm)*' '[Ll]ibre' | dot
 ![libfsm.svg](doc/tutorial/libfsm.svg)
 
+libfsm is not a drop-in replacement for other regex engines, and it only supports patterns that can be compiled to deterministic FSMs. In return, supported patterns run in linear time.
+
 Getting started:
 
  * See the [tutorial introduction](doc/tutorial/re.md) for a quick overview
    of the re(1) command line interface.
  * [Compilation phases](doc/tutorial/phases.md) for typical applications
    which compile regular expressions to code.
+ * [Advice on using libfsm](doc/advice.md) for suggestions around compilation time, unsupported features, common usage patterns, and examples.
 
 You get:
 
@@ -24,12 +27,6 @@ lx is an attempt to produce a simple, expressive, and unobtrusive
 lexer generator which is good at lexing, does just lexing,
 is language independent, and has no other features.
 
-### Performance and Requirements
-
-libfsm is not a drop-in replacement for other regex engines and it only supports patterns that can be compiled to deterministic FSMs. In return, supported patterns run in linear time.
-
-**→ See [doc/GUIDE.md](doc/GUIDE.md) for detailed unsupported features, usage patterns, and examples.**
-
 ### Building from source
 
 Clone with submodules (contains required .mk files):

doc/GUIDE.md doc/advice.mddoc/GUIDE.md renamed to doc/advice.md

@@ -1,4 +1,4 @@
-# Using libfsm for High-Performance Pattern Matching
+# Advice on using libfsm for high-performance pattern matching
 
 libfsm compiles regular expressions to deterministic finite state machines (FSMs) and generates executable code. FSM-based matching runs in **linear time O(n)** with **no backtracking**.