Re: [go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-11-26 Thread Scott Pakin
On Friday, November 23, 2018 at 1:58:37 PM UTC-7, Ben Hoyt wrote: > > So my main suggestion (for spakin/awk) would be able to wrap os.Stdout in > a bufio.NewWriter (and be sure to call Flush before Run finishes). If the > user wants to pass an unbuffered version, they still can, but at least the

Re: [go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-11-23 Thread Ben Hoyt
> Once you have some proper benchmarks, it might be fun to compare GoAWK's >>> performance to that of my awk package . >>> >> I'm not going to do thorough benchmarks at this point, but it looks like GoAWK is significantly faster at present. Using the example in the ht

Re: [go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-11-22 Thread Michael Jones
and always: https://www.cs.princeton.edu/~bwk/btl.mirror/awkc++.pdf On Thu, Nov 22, 2018 at 8:24 PM Tong Sun wrote: > > > On Tuesday, August 28, 2018 at 9:06:22 AM UTC-4, Ben Hoyt wrote: >> >> Once you have some proper benchmarks, it might be fun to compare GoAWK's >>> performance to that of my

Re: [go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-11-22 Thread Tong Sun
On Tuesday, August 28, 2018 at 9:06:22 AM UTC-4, Ben Hoyt wrote: > > Once you have some proper benchmarks, it might be fun to compare GoAWK's >> performance to that of my awk package . >> > > Nice -- will do! > Please post back when you've done that. I'm intere

Re: [go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-08-28 Thread Ben Hoyt
> > Once you have some proper benchmarks, it might be fun to compare GoAWK's > performance to that of my awk package . > Nice -- will do! I don't know how much performance difference this makes in practice, but my > value struct (also in a value.go file) lazily conv

[go-nuts] Re: GoAWK: an AWK interpreter written in Go

2018-08-27 Thread Scott Pakin
On Friday, August 24, 2018 at 3:13:25 PM UTC-6, Ben Hoyt wrote: > > I recently wrote an AWK interpreter in Go: > https://github.com/benhoyt/goawk > > It's a pretty simple implementation: hand-rolled lexer, recursive-descent > parser, and tree-walk interpreter. It's pretty complete according to th