anchor.diff:  
   <1> *Patterns of arbitrary complexity*: `match()` is not restricted to triple patterns or property paths.
   <2> *Recursion support*: `match()` supports the branch-based steps within a pattern, including `repeat()`.
  -<3> *Imperative/declarative hybrid*: Pre and prior to a `match()`, it is possible to leverage classic Gremlin traversals.
  +<3> *Imperative/declarative hybrid*: Before and after a `match()`, it is possible to leverage classic Gremlin traversals.
   
   To extend point #3, it is possible to support going from imperative, to declarative, to imperative, ad infinitum.
   
  
positive.code:         __.as('c').has('age', 29)).select('a','c').by('name')
  ----
  
  Note that the above can also be more concisely written as below which demonstrates that imperative inner-traversals can be arbitrarily defined.
  
  [gremlin-groovy,modern]
  ----
  
negative.code:     ).select('a','b','c').by('name').by('name').by() <6>
  ----
  
  <1> A standard, step-labeled traversal can come prior to `match()`.
  <2> If the traverser's path prior to entering `match()` has the requisite variables, then no "start variable" is needed.
  <3> It is possible to use <<a-note-on-barrier-steps,barrier steps>> though they are computed locally to the pattern (as one would expect).
  <4> It is possible to nest `and()`- and `or()`-steps for conjunction matching.
  