mirror of
https://github.com/golang/go
synced 2024-11-20 08:54:40 -07:00
cmd/compile: move parser.go remnants into noder.go
Change-Id: I54f8788a4703283b9aa3904e2e610097ac3e3586 Reviewed-on: https://go-review.googlesource.com/32471 Run-TryBot: Matthew Dempsky <mdempsky@google.com> Reviewed-by: Robert Griesemer <gri@golang.org>
This commit is contained in:
parent
f2d05389da
commit
2d4d22af7e
@ -1150,3 +1150,18 @@ func (p *noder) pragma(pos, line int, text string) syntax.Pragma {
|
||||
|
||||
return 0
|
||||
}
|
||||
|
||||
func mkname(sym *Sym) *Node {
|
||||
n := oldname(sym)
|
||||
if n.Name != nil && n.Name.Pack != nil {
|
||||
n.Name.Pack.Used = true
|
||||
}
|
||||
return n
|
||||
}
|
||||
|
||||
func unparen(x *Node) *Node {
|
||||
for x.Op == OPAREN {
|
||||
x = x.Left
|
||||
}
|
||||
return x
|
||||
}
|
||||
|
@ -1,28 +0,0 @@
|
||||
// Copyright 2015 The Go Authors. All rights reserved.
|
||||
// Use of this source code is governed by a BSD-style
|
||||
// license that can be found in the LICENSE file.
|
||||
|
||||
package gc
|
||||
|
||||
// The recursive-descent parser is built around a slighty modified grammar
|
||||
// of Go to accommodate for the constraints imposed by strict one token look-
|
||||
// ahead, and for better error handling. Subsequent checks of the constructed
|
||||
// syntax tree restrict the language accepted by the compiler to proper Go.
|
||||
//
|
||||
// Semicolons are inserted by the lexer. The parser uses one-token look-ahead
|
||||
// to handle optional commas and semicolons before a closing ) or } .
|
||||
|
||||
func mkname(sym *Sym) *Node {
|
||||
n := oldname(sym)
|
||||
if n.Name != nil && n.Name.Pack != nil {
|
||||
n.Name.Pack.Used = true
|
||||
}
|
||||
return n
|
||||
}
|
||||
|
||||
func unparen(x *Node) *Node {
|
||||
for x.Op == OPAREN {
|
||||
x = x.Left
|
||||
}
|
||||
return x
|
||||
}
|
Loading…
Reference in New Issue
Block a user