AbstractSyntaxNode generalization & convenience (#208)

These add a couple more convenience methods useful for TypedSyntax.

Author: timholy

src/syntax_tree.jl

@@ -152,9 +152,9 @@ haschildren(node::TreeNode) = node.children !== nothing
 children(node::TreeNode) = (c = node.children; return c === nothing ? () : c)
 
 
-head(node::SyntaxNode) = head(node.raw)
+head(node::AbstractSyntaxNode) = head(node.raw)
 
-span(node::SyntaxNode) = span(node.raw)
+span(node::AbstractSyntaxNode) = span(node.raw)
 
 first_byte(node::AbstractSyntaxNode) = node.position
 last_byte(node::AbstractSyntaxNode)  = node.position + span(node) - 1
@@ -169,6 +169,9 @@ function sourcetext(node::AbstractSyntaxNode)
     view(node.source, val_range)
 end
 
+source_line(node::AbstractSyntaxNode) = source_line(node.source, node.position)
+source_location(node::AbstractSyntaxNode) = source_location(node.source, node.position)
+
 function interpolate_literal(node::SyntaxNode, val)
     @assert kind(node) == K"$"
     SyntaxNode(node.source, node.raw, node.position, node.parent, true, val)

test/syntax_tree.jl

@@ -11,6 +11,8 @@
     @test sourcetext(child(t, 3))    == "c"
 
     @test JuliaSyntax.first_byte(child(t, 2)) == findfirst(==('+'), tt)
+    @test JuliaSyntax.source_line(child(t, 3)) == 1
+    @test source_location(child(t, 3)) == (1, 7)
 
     # Child indexing
     @test t[1]    === child(t, 1)