net.siisise.abnf.ABNFplu Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of softlib-abnf.module Show documentation
Java ABNF parser CC
The newest version!
/*
 * Copyright 2021 Siisise Net.
 *
 * 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 net.siisise.abnf;

import net.siisise.block.ReadableBlock;
import net.siisise.bnf.BNF;
import net.siisise.bnf.BNFReg;
import net.siisise.bnf.parser.BNFParser;

/**
 *
 */
public class ABNFplu extends ABNFplm {

    public ABNFplu(BNF[] list) {
        super(list);
    }

    /**
     * 複製する.
     * @param reg 複製先
     * @return 複製 
     */
    @Override
    public ABNFpl copy(BNFReg reg) {
        BNF[] l = new BNF[list.length];

        for (int i = 0; i < list.length; i++) {
            l[i] = this.list[i].copy(reg);
        }
        return new ABNFplu(l);
    }

    /**
     * 詳細検索
     *
     * @param  適度な戻り型
     * @param pac source 解析対象
     * @param ns user name space 名前空間
     * @param subparsers サブ要素パーサ
     * @return ざっくりまとめ
     */
    @Override
    protected  Match longfind(ReadableBlock pac, Object ns, int start, BNFParser[] subparsers) {
        if (list.length == start) {
            return new Match(pac);
        }
        long frontMax = pac.length();
        long op = pac.backLength();
        do {
            // 1つめ 指定サイズまでに制限する
            ReadableBlock frontPac = pac.readBlock(frontMax);

            Match firstret = list[start].find(frontPac, ns, subparsers);
            pac.back(frontPac.length());
            if ( firstret == null ) {
                return null;
            }

            firstret.st = op;
            if (list.length - start == 1) { // 一致しないか最後ならここで戻り
                return firstret;
            }
            frontMax = pac.backLength() - op;
            // 2つめ以降
            Match nextret = longfind(pac, ns, start + 1, subparsers);
            if (nextret != null) {
                // firstret と nextret 両方成立
                mix(firstret, nextret);
                return firstret;
            }
            // scのみ成立 破棄
            pac.seek(op);
//            byte[] sdata = firstret.ret.toByteArray();
            // ToDo: utf-8で1文字戻る版にしてみた
            frontMax--;
            firstret.sub.seek(firstret.sub.length());
            while (frontMax >= 0 && (firstret.sub.backRead() & 0xc0) == 0x80) {
                frontMax--;
            }

        } while (frontMax >= 0);
        return null;
    }
}