0xkohe’s gists

0xkohe / called functions

Created September 26, 2019 04:59

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う] called functions

	BEGIN parseExpresssionStatement
	BEGIN parseExpresssion
	BEGIN parseIntegerLiteral
	END parseIntegerLiteral
	BEGIN parseInfixExpression
	BEGIN parseExpresssion
	BEGIN parseIntegerLiteral
	END parseIntegerLiteral
	END parseExpresssion
	END parseInfixExpression

0xkohe / parseIntegerLiteral.go

Created September 26, 2019 04:52

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]precedence.go parseIntegerLiteral.go

	func (p *Parser) parseIntegerLiteral() ast.Expression {
	lit := &ast.IntegerLiteral{Token: p.curToken}

	value, err := strconv.ParseInt(p.curToken.Literal, 0, 64)
	if err != nil {
	msg := fmt.Sprintf("could not parse %q as integer", p.curToken.Literal)
	p.errors = append(p.errors, msg)
	return nil
	}
	lit.Value = value

0xkohe / parsePrefixExpression.go

Created September 26, 2019 04:52

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]precedence.go parsePrefixExpression.go

	func (p *Parser) parsePrefixExpression() ast.Expression {
	expression := &ast.PrefixExpression{
	Token: p.curToken,
	Operator: p.curToken.Literal,
	}

	p.nextToken()

	expression.Right = p.parseExpression(PREFIX)

0xkohe / parseInfixExpression.go

Created September 26, 2019 04:51

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]precedence.goparseInfixExpression.go

	func (p *Parser) parseInfixExpression(left ast.Expression) ast.Expression {
	expression := &ast.InfixExpression{
	Token: p.curToken,
	Operator: p.curToken.Literal,
	Left: left,
	}

	precedence := p.curPrecedence()
	p.nextToken()
	expression.Right = p.parseExpression(precedence)

0xkohe / parseExpressionStatement.go

Created September 26, 2019 04:51

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う] parseExpressionStatement.go

	func (p Parser) parseExpressionStatement() ast.ExpressionStatement {
	stmt := &ast.ExpressionStatement{Token: p.curToken}

	stmt.Expression = p.parseExpression(LOWEST)

	if p.peekTokenIs(token.SEMICOLON) {
	p.nextToken()
	}

	return stmt

0xkohe / parseExpression.go

Created September 26, 2019 04:50

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]parseExpression.go

	func (p *Parser) parseExpression(precedence int) ast.Expression {
	prefix := p.prefixParseFns[p.curToken.Type]
	if prefix == nil {
	p.noPrefixParseFnError(p.curToken.Type)
	return nil
	}
	leftExp := prefix()

	for !p.peekTokenIs(token.SEMICOLON) && precedence < p.peekPrecedence() {
	infix := p.infixParseFns[p.peekToken.Type]

0xkohe / precedence.go

Created September 26, 2019 04:49

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]precedence.go

0xkohe / parseExpression.go

Last active September 26, 2019 04:43

[Blog][TopDownOperatorPrecedence(再帰下降構文解析)におけるExpression(式)の解析処理を追う]

	func (p *Parser) parseExpression(precedence int) ast.Expression {
	prefix := p.prefixParseFns[p.curToken.Type]
	if prefix == nil {
	p.noPrefixParseFnError(p.curToken.Type)
	return nil
	}
	leftExp := prefix()

	for !p.peekTokenIs(token.SEMICOLON) && precedence < p.peekPrecedence() {
	infix := p.infixParseFns[p.peekToken.Type]

0xkohe 0xkohe