// Path: MaleRegexTree/src/it/units/inginf/male/tree/DescriptionContext.java
// public class DescriptionContext {
//     int groups;
//     int expansionGroups = 0;
// 
//     public int getGroups() {
//         return groups;
//     }
// 
//     public int incGroups(){
//         groups++;
//         return groups;
//     }
// 
//     public int getExpansionGroups() {
//         return expansionGroups;
//     }
// 
//     public void incExpansionGroups() {
//         this.expansionGroups++;
//     }
//     
// }
// 
// Path: MaleRegexTree/src/it/units/inginf/male/tree/Node.java
// public interface Node {
//     
//     Node cloneTree();
// 
//     Node getParent();
//     void setParent(Node parent);
//     
//     int getMinChildrenCount();
//     int getMaxChildrenCount();
//     List<Node> getChildrens();
//     long getId();
//     
//     void describe(StringBuilder builder);
//     void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour);
//     boolean isValid();
// 
//     public enum RegexFlavour {
//         JAVA,
//         CSHARP,
//         JS
//     }
//     public boolean isCharacterClass();
//     public boolean isEscaped();
// }


import it.units.inginf.male.tree.DescriptionContext;
import it.units.inginf.male.tree.Node;
/*
 * Copyright (C) 2015 Machine Learning Lab - University of Trieste, 
 * Italy (http://machinelearning.inginf.units.it/)  
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package it.units.inginf.male.tree.operator;


/**
 *
 * @author MaleLabTs
 */
public class MatchOneOrMore extends Quantifier {

    @Override
    public void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour) {
        StringBuilder tmp = new StringBuilder();
        Node child = getChildrens().get(0);
        // Counts the group immediatly
        int index = context.incGroups();
        child.describe(tmp, context, flavour);
        int l = child.isEscaped() ? tmp.length() - 1 : tmp.length();
        boolean group = l > 1 && !child.isCharacterClass() && !(child instanceof Group) && !(child instanceof NonCapturingGroup);
        switch (flavour) {
            case JAVA:
                if (group) {
                    builder.append("(?:");
                    builder.append(tmp);
                    builder.append(")");
                } else {
                    builder.append(tmp);
                }
                builder.append("++");
                break;
// Path: MaleRegexTree/src/it/units/inginf/male/tree/DescriptionContext.java
// public class DescriptionContext {
//     int groups;
//     int expansionGroups = 0;
// 
//     public int getGroups() {
//         return groups;
//     }
// 
//     public int incGroups(){
//         groups++;
//         return groups;
//     }
// 
//     public int getExpansionGroups() {
//         return expansionGroups;
//     }
// 
//     public void incExpansionGroups() {
//         this.expansionGroups++;
//     }
//     
// }
// 
// Path: MaleRegexTree/src/it/units/inginf/male/tree/Node.java
// public interface Node {
//     
//     Node cloneTree();
// 
//     Node getParent();
//     void setParent(Node parent);
//     
//     int getMinChildrenCount();
//     int getMaxChildrenCount();
//     List<Node> getChildrens();
//     long getId();
//     
//     void describe(StringBuilder builder);
//     void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour);
//     boolean isValid();
// 
//     public enum RegexFlavour {
//         JAVA,
//         CSHARP,
//         JS
//     }
//     public boolean isCharacterClass();
//     public boolean isEscaped();
// }


// Path: MaleRegexTree/src/it/units/inginf/male/tree/operator/MatchOneOrMore.java
import it.units.inginf.male.tree.DescriptionContext;
import it.units.inginf.male.tree.Node;

/*
 * Copyright (C) 2015 Machine Learning Lab - University of Trieste, 
 * Italy (http://machinelearning.inginf.units.it/)  
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package it.units.inginf.male.tree.operator;


/**
 *
 * @author MaleLabTs
 */
public class MatchOneOrMore extends Quantifier {

    @Override
    public void describe(StringBuilder builder, DescriptionContext context, RegexFlavour flavour) {
        StringBuilder tmp = new StringBuilder();
        Node child = getChildrens().get(0);
        // Counts the group immediatly
        int index = context.incGroups();
        child.describe(tmp, context, flavour);
        int l = child.isEscaped() ? tmp.length() - 1 : tmp.length();
        boolean group = l > 1 && !child.isCharacterClass() && !(child instanceof Group) && !(child instanceof NonCapturingGroup);
        switch (flavour) {
            case JAVA:
                if (group) {
                    builder.append("(?:");
                    builder.append(tmp);
                    builder.append(")");
                } else {
                    builder.append(tmp);
                }
                builder.append("++");
                break;
            default: