Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
Copyright 2013 Ilya Lakhin (Илья Александрович Лахин)
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package name.lakhin.eliah.projects
package papacarlo.syntax.rules
import name.lakhin.eliah.projects.papacarlo.lexis.TokenReference
import name.lakhin.eliah.projects.papacarlo.syntax.{State, Node, Session, Rule}
import name.lakhin.eliah.projects.papacarlo.syntax.Result._
final case class ExpressionRule(tag: String, atom: Rule) extends Rule {
final class ExpressionState(private[ExpressionRule] val session: Session) {
private[ExpressionRule] var issues: Boolean = false
private var states = List.empty[(State, Boolean)]
def parseRight(rightBindingPower: Int = 0) =
ExpressionRule.this.parse(this, rightBindingPower)
def placeholder = {
val place = session.reference(session
.relativeIndexOf(session.state.virtualPosition))
new Node(RecoveryRule.PlaceholderKind, place, place)
}
def consume(expectedToken: String, optional: Boolean = false) = {
val currentPosition = session.state.virtualPosition
val actualKind = session
.tokens
.lift(currentPosition)
.map(_.kind)
.getOrElse(TokenRule.EndOfFragmentKind)
if (expectedToken == actualKind) {
val tokenReference = reference(session)
session.state = session.state
.copy(virtualPosition = currentPosition + 1)
Some(tokenReference)
} else if (!optional) {
issues = true
session.state = session.state
.issue(expectedToken + " expected, but " + actualKind + " found")
None
} else {
None
}
}
def saveState() {
states ::= session.state -> issues
}
def freeState() {
states match {
case _ :: tail => states = tail
case _ =>
}
}
def restoreState() {
states match {
case head :: tail =>
session.state = head._1
issues = head._2
states = tail
case _ =>
}
}
}
final class Parselet {
private[ExpressionRule] var lbp: Int = 0
private[ExpressionRule] var nud =
Option.empty[(ExpressionState, TokenReference) => Node]
private[ExpressionRule] var led =
Option.empty[(ExpressionState, Node, TokenReference) => Node]
def leftBindingPower(lbp: Int) = {
this.lbp = lbp
this
}
def nullDenotation(procedure: (ExpressionState,
TokenReference) => Node) = {
this.nud = Some(procedure)
this
}
def leftDenotation(procedure: (ExpressionState, Node,
TokenReference) => Node) = {
this.led = Some(procedure)
this
}
}
private var parselets = Map.empty[String, Parselet]
def apply(session: Session) = {
session.syntax.onRuleEnter.trigger(this, session.state)
val state = new ExpressionState(session)
val result = parse(state) match {
case Some(result: Node) =>
session.state = session.state.copy(products = (tag, result) ::
session.state.products)
if (state.issues) Recoverable
else Successful
case None => Failed
}
session.syntax.onRuleLeave.trigger(this, session.state, result)
result
}
def parselet(operator: String) =
parselets.getOrElse(operator, {
val parselet = new Parselet
parselets += operator -> parselet
parselet
})
private def token(session: Session) =
session
.tokens
.lift(session.state.virtualPosition)
.map(_.kind)
.getOrElse(TokenRule.EndOfFragmentKind)
def reference(session: Session) =
session.reference(session.relativeIndexOf(session.state.virtualPosition))
private def next(session: Session) = {
val result = reference(session)
session.state = session.state.copy(virtualPosition =
session.state.virtualPosition + 1)
result
}
private def operand(expression: ExpressionState) = {
val initialState = expression.session.state
if (atom(expression.session) != Successful) expression.issues = true
val result = expression.session.state.products
.headOption
.filter(_._1 == ExpressionRule.Operand &&
expression.session.state.products.length > initialState.products.length)
.map(_._2)
expression.session.state =
if (result.isDefined)
expression.session.state.copy(products = initialState.products)
else
initialState.copy(issues = expression.session.state.issues)
result
}
private def parse(expression: ExpressionState,
rightBindingPower: Int = 0): Option[Node] =
parselets.get(token(expression.session))
.flatMap(parselet => parselet.nud.map(nud => {
val operatorReference = next(expression.session)
Some(nud(expression, operatorReference))
}))
.getOrElse(operand(expression))
.map {
first =>
var left = first
var finished = false
while (!finished) {
finished = true
for (parselet <- parselets.get(token(expression.session));
led <- parselet.led if rightBindingPower < parselet.lbp) {
left = led(expression, left, next(expression.session))
finished = false
}
}
left
}
override val show = "expression(" + atom.show._1 + ") -> " + tag -> 1
override val captures = atom.captures
override val branches = Map.empty[String, Set[String]]
}
object ExpressionRule {
val Operand = "operand"
}