summaryrefslogtreecommitdiff
path: root/node_modules/spdx-expression-parse/parse.js
diff options
context:
space:
mode:
authorLinuxWizard42 <computerwizard@linuxmail.org>2022-10-12 23:08:57 +0300
committerLinuxWizard42 <computerwizard@linuxmail.org>2022-10-12 23:08:57 +0300
commit726b81b19251674e149ccfbb1abacbd837fc6db0 (patch)
treefbdbb227dc01357eb76e8222d76185bc124c5ca6 /node_modules/spdx-expression-parse/parse.js
parent34f0890e175698940d49238097579f44e4d78c89 (diff)
downloadFlashRunner-726b81b19251674e149ccfbb1abacbd837fc6db0.tar.gz
FlashRunner-726b81b19251674e149ccfbb1abacbd837fc6db0.tar.zst
Removed files that should not have been included in git
Diffstat (limited to 'node_modules/spdx-expression-parse/parse.js')
-rw-r--r--node_modules/spdx-expression-parse/parse.js138
1 files changed, 0 insertions, 138 deletions
diff --git a/node_modules/spdx-expression-parse/parse.js b/node_modules/spdx-expression-parse/parse.js
deleted file mode 100644
index 5a00b45..0000000
--- a/node_modules/spdx-expression-parse/parse.js
+++ /dev/null
@@ -1,138 +0,0 @@
-'use strict'
-
-// The ABNF grammar in the spec is totally ambiguous.
-//
-// This parser follows the operator precedence defined in the
-// `Order of Precedence and Parentheses` section.
-
-module.exports = function (tokens) {
- var index = 0
-
- function hasMore () {
- return index < tokens.length
- }
-
- function token () {
- return hasMore() ? tokens[index] : null
- }
-
- function next () {
- if (!hasMore()) {
- throw new Error()
- }
- index++
- }
-
- function parseOperator (operator) {
- var t = token()
- if (t && t.type === 'OPERATOR' && operator === t.string) {
- next()
- return t.string
- }
- }
-
- function parseWith () {
- if (parseOperator('WITH')) {
- var t = token()
- if (t && t.type === 'EXCEPTION') {
- next()
- return t.string
- }
- throw new Error('Expected exception after `WITH`')
- }
- }
-
- function parseLicenseRef () {
- // TODO: Actually, everything is concatenated into one string
- // for backward-compatibility but it could be better to return
- // a nice structure.
- var begin = index
- var string = ''
- var t = token()
- if (t.type === 'DOCUMENTREF') {
- next()
- string += 'DocumentRef-' + t.string + ':'
- if (!parseOperator(':')) {
- throw new Error('Expected `:` after `DocumentRef-...`')
- }
- }
- t = token()
- if (t.type === 'LICENSEREF') {
- next()
- string += 'LicenseRef-' + t.string
- return { license: string }
- }
- index = begin
- }
-
- function parseLicense () {
- var t = token()
- if (t && t.type === 'LICENSE') {
- next()
- var node = { license: t.string }
- if (parseOperator('+')) {
- node.plus = true
- }
- var exception = parseWith()
- if (exception) {
- node.exception = exception
- }
- return node
- }
- }
-
- function parseParenthesizedExpression () {
- var left = parseOperator('(')
- if (!left) {
- return
- }
-
- var expr = parseExpression()
-
- if (!parseOperator(')')) {
- throw new Error('Expected `)`')
- }
-
- return expr
- }
-
- function parseAtom () {
- return (
- parseParenthesizedExpression() ||
- parseLicenseRef() ||
- parseLicense()
- )
- }
-
- function makeBinaryOpParser (operator, nextParser) {
- return function parseBinaryOp () {
- var left = nextParser()
- if (!left) {
- return
- }
-
- if (!parseOperator(operator)) {
- return left
- }
-
- var right = parseBinaryOp()
- if (!right) {
- throw new Error('Expected expression')
- }
- return {
- left: left,
- conjunction: operator.toLowerCase(),
- right: right
- }
- }
- }
-
- var parseAnd = makeBinaryOpParser('AND', parseAtom)
- var parseExpression = makeBinaryOpParser('OR', parseAnd)
-
- var node = parseExpression()
- if (!node || hasMore()) {
- throw new Error('Syntax error')
- }
- return node
-}