├── doc └── SymbolicExpression.png ├── MathematicalExpressionParser.Core ├── MathematicalExpressionParser.Core.nuspec ├── MathematicalExpressionParser.Core.fsproj ├── ExpressionTree.fs └── ExpressionParser.fs ├── MathematicalExpressionParser.Core.Test ├── Program.fs ├── MathematicalExpressionParser.Core.Test.fsproj ├── ExpressionTreeTest.fs └── ExpressionParserTest.fs ├── .vsconfig ├── MathematicalExpressionParser.sln ├── README.md ├── .gitignore └── COPYING /doc/SymbolicExpression.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Deltares/mathematical_expression_parser/master/doc/SymbolicExpression.png -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core/MathematicalExpressionParser.Core.nuspec: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | $id$ 5 | $version$ 6 | $title$ 7 | $author$ 8 | $author$ 9 | GPL-3.0-or-later 10 | https://github.com/Deltares/mathematical_expression_parser 11 | http://bit.ly/192jI3c 12 | false 13 | $description$ 14 | Updated licese to GPL. 15 | $copyright$ 16 | Symbolic Expression Mathematics Parser 17 | 18 | 19 | 20 | 21 | 22 | 23 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core.Test/Program.fs: -------------------------------------------------------------------------------- 1 | // Copyright 2025 © Deltares 2 | // 3 | // This file is part of the Mathematical Expression Parser. 4 | // 5 | // The Mathematical Expression Parser is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | // 10 | // The Mathematical Expression Parser is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | // 15 | // You should have received a copy of the GNU General Public License 16 | // along with the Mathematical Expression Parser. If not, see 17 | 18 | module Program 19 | 20 | let [] main _ = 0 21 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core.Test/MathematicalExpressionParser.Core.Test.fsproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | net48 5 | 6 | false 7 | false 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | -------------------------------------------------------------------------------- /.vsconfig: -------------------------------------------------------------------------------- 1 | { 2 | "version": "1.0", 3 | "components": [ 4 | "Microsoft.VisualStudio.Component.CoreEditor", 5 | "Microsoft.VisualStudio.Workload.CoreEditor", 6 | "Microsoft.VisualStudio.Component.NuGet", 7 | "Microsoft.Net.Component.4.6.1.TargetingPack", 8 | "Microsoft.VisualStudio.Component.Roslyn.Compiler", 9 | "Microsoft.VisualStudio.Component.Roslyn.LanguageServices", 10 | "Microsoft.VisualStudio.Component.FSharp", 11 | "Microsoft.Net.Component.4.7.2.SDK", 12 | "Microsoft.Net.Component.4.7.2.TargetingPack", 13 | "Microsoft.Net.ComponentGroup.DevelopmentPrerequisites", 14 | "Microsoft.Component.MSBuild", 15 | "Microsoft.VisualStudio.Component.TextTemplating", 16 | "Microsoft.VisualStudio.Component.ManagedDesktop.Core", 17 | "Microsoft.Net.Component.4.6.TargetingPack", 18 | "Microsoft.VisualStudio.Component.ManagedDesktop.Prerequisites", 19 | "Microsoft.VisualStudio.Component.FSharp.Desktop", 20 | "Microsoft.VisualStudio.Workload.ManagedDesktop", 21 | "Microsoft.VisualStudio.Component.VSSDK", 22 | "Microsoft.VisualStudio.ComponentGroup.VisualStudioExtension.Prerequisites", 23 | "Microsoft.VisualStudio.Workload.VisualStudioExtension" 24 | ] 25 | } -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core/MathematicalExpressionParser.Core.fsproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | net48 5 | true 6 | 7 | MathematicalExpressionParser.Core 8 | 9 | 2.0.0 10 | 2.0.0 11 | 12 | The MathematicalExpressionParser.Core library is used to parse mathematical-expression strings to symbolic-expression trees. 13 | Deltares 14 | MathematicalExpressionParser.Core 15 | Copyright © Deltares $([System.DateTime]::Now.Year) 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | <_Parameter1>$(AssemblyName).Test 39 | 40 | 41 | 42 | 43 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.sln: -------------------------------------------------------------------------------- 1 | 2 | Microsoft Visual Studio Solution File, Format Version 12.00 3 | # Visual Studio Version 17 4 | VisualStudioVersion = 17.2.32516.85 5 | MinimumVisualStudioVersion = 10.0.40219.1 6 | Project("{6EC3EE1D-3C4E-46DD-8F32-0CC8E7565705}") = "MathematicalExpressionParser.Core", "MathematicalExpressionParser.Core\MathematicalExpressionParser.Core.fsproj", "{FBE09758-70B2-4FC4-8742-52AABAF03680}" 7 | EndProject 8 | Project("{F2A71F9B-5D33-465A-A702-920D77279786}") = "MathematicalExpressionParser.Core.Test", "MathematicalExpressionParser.Core.Test\MathematicalExpressionParser.Core.Test.fsproj", "{A7001583-0037-46F3-8309-E80CE4A80833}" 9 | EndProject 10 | Global 11 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 12 | Debug|Any CPU = Debug|Any CPU 13 | Release|Any CPU = Release|Any CPU 14 | EndGlobalSection 15 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 16 | {FBE09758-70B2-4FC4-8742-52AABAF03680}.Debug|Any CPU.ActiveCfg = Debug|Any CPU 17 | {FBE09758-70B2-4FC4-8742-52AABAF03680}.Debug|Any CPU.Build.0 = Debug|Any CPU 18 | {FBE09758-70B2-4FC4-8742-52AABAF03680}.Release|Any CPU.ActiveCfg = Release|Any CPU 19 | {FBE09758-70B2-4FC4-8742-52AABAF03680}.Release|Any CPU.Build.0 = Release|Any CPU 20 | {A7001583-0037-46F3-8309-E80CE4A80833}.Debug|Any CPU.ActiveCfg = Debug|Any CPU 21 | {A7001583-0037-46F3-8309-E80CE4A80833}.Debug|Any CPU.Build.0 = Debug|Any CPU 22 | {A7001583-0037-46F3-8309-E80CE4A80833}.Release|Any CPU.ActiveCfg = Release|Any CPU 23 | {A7001583-0037-46F3-8309-E80CE4A80833}.Release|Any CPU.Build.0 = Release|Any CPU 24 | EndGlobalSection 25 | GlobalSection(SolutionProperties) = preSolution 26 | HideSolutionNode = FALSE 27 | EndGlobalSection 28 | GlobalSection(ExtensibilityGlobals) = postSolution 29 | SolutionGuid = {49FDC4F8-D0E7-4D99-8357-74D36D430B98} 30 | EndGlobalSection 31 | EndGlobal 32 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core.Test/ExpressionTreeTest.fs: -------------------------------------------------------------------------------- 1 | // Copyright 2025 © Deltares 2 | // 3 | // This file is part of the Mathematical Expression Parser. 4 | // 5 | // The Mathematical Expression Parser is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | // 10 | // The Mathematical Expression Parser is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | // 15 | // You should have received a copy of the GNU General Public License 16 | // along with the Mathematical Expression Parser. If not, see 17 | 18 | module MathematicalExpressionParser.Core.ExpressionTreeTest 19 | 20 | open MathematicalExpressionParser.Core.ExpressionTree 21 | 22 | open FsUnit 23 | open NUnit.Framework 24 | 25 | [] 26 | let ``binaryFunctions: Expected functions defined``() = 27 | Expression.binaryFunctions |> should haveLength 2 28 | Expression.binaryFunctions |> should contain ("min", Min) 29 | Expression.binaryFunctions |> should contain ("max", Max) 30 | 31 | 32 | [] 33 | let ``infixFunctions: Expected functions defined``() = 34 | Expression.infixFunctions |> should haveLength 4 35 | Expression.infixFunctions |> should contain ("+", Addition, 1) 36 | Expression.infixFunctions |> should contain ("-", Subtraction, 1) 37 | Expression.infixFunctions |> should contain ("*", Multiplication, 2) 38 | Expression.infixFunctions |> should contain ("/", Division, 2) 39 | 40 | 41 | [] 42 | let ``composedExpression: Expected results``() = 43 | // Setup 44 | let expectedOperator = InfixFunction Addition 45 | let expectedOperand1 = AtomicExpression ( Parameter "A" ) 46 | let expectedOperand2 = AtomicExpression ( Parameter "B" ) 47 | 48 | // Call 49 | let result = Expression.composedExpression expectedOperator 50 | expectedOperand1 51 | expectedOperand2 52 | 53 | // Assert 54 | result.operator |> should sameAs expectedOperator 55 | result.firstOperand |> should sameAs expectedOperand1 56 | result.secondOperand |> should sameAs expectedOperand2 57 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core/ExpressionTree.fs: -------------------------------------------------------------------------------- 1 | // Copyright 2025 © Deltares 2 | // 3 | // This file is part of the Mathematical Expression Parser. 4 | // 5 | // The Mathematical Expression Parser is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | // 10 | // The Mathematical Expression Parser is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | // 15 | // You should have received a copy of the GNU General Public License 16 | // along with the Mathematical Expression Parser. If not, see 17 | 18 | namespace MathematicalExpressionParser.Core.ExpressionTree 19 | 20 | /// 21 | /// defines the possible infix functions. 22 | /// 23 | type InfixFunctionType = 24 | | Addition 25 | | Subtraction 26 | | Multiplication 27 | | Division 28 | 29 | /// 30 | /// defines the possible binary function types. 31 | /// 32 | type BinaryFunctionType = 33 | | Min 34 | | Max 35 | 36 | /// 37 | /// defines the possible expression 38 | /// operators. 39 | /// 40 | type ExpressionOperatorType = 41 | | InfixFunction of InfixFunctionType 42 | | BinaryFunction of BinaryFunctionType 43 | 44 | /// 45 | /// defines the possible atomic expressions, 46 | /// i.e. the expressions that cannot be divided further. 47 | /// 48 | type AtomicExpressionType = 49 | | Constant of float 50 | | Parameter of string 51 | 52 | /// 53 | /// defines the record describing a single 54 | /// composed operation, as an operator and two operands. 55 | /// 56 | type ComposedExpressionType = 57 | { operator : ExpressionOperatorType 58 | ; firstOperand : ExpressionType 59 | ; secondOperand : ExpressionType 60 | } 61 | /// 62 | /// defines the possible expressions. 63 | /// 64 | and ExpressionType = 65 | | AtomicExpression of AtomicExpressionType 66 | | ComposedExpression of ComposedExpressionType 67 | 68 | /// 69 | /// defines the possible results when parsing an 70 | /// expression. 71 | /// 72 | type ParserResult = 73 | | Success of ExpressionType 74 | | Failure of string 75 | 76 | module internal Expression = 77 | /// 78 | /// The set of binary function identifiers and their corresponding 79 | /// . 80 | /// 81 | let binaryFunctions = 82 | [ ("min", Min) 83 | ; ("max", Max) 84 | ] 85 | 86 | /// 87 | /// The set of infix functions, their corresponding 88 | /// , and their precedence value. 89 | /// 90 | let infixFunctions = 91 | [ ("+", Addition, 1) 92 | ; ("-", Subtraction, 1) 93 | ; ("*", Multiplication, 2) 94 | ; ("/", Division, 2) 95 | ] 96 | 97 | /// 98 | /// Construct a new with the 99 | /// given parameters. 100 | /// 101 | /// The operator 102 | /// The first operand of this expression. 103 | /// The second operand of this expression. 104 | /// 105 | /// A new with the given parameters. 106 | /// 107 | let composedExpression ( operator : ExpressionOperatorType ) 108 | ( firstOperand : ExpressionType ) 109 | ( secondOperand : ExpressionType ) = 110 | { operator = operator 111 | ; firstOperand = firstOperand 112 | ; secondOperand = secondOperand 113 | } 114 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Mathematical Expression Parser 2 | 3 | The Mathematical Expression Parser is a simple parser to convert Mathematical 4 | Expressions written as a string, to Symbolic Expression trees, as shown 5 | in the following picture: 6 | 7 |

SymbolicExpressionTree

8 | 9 | ## How to use: 10 | 11 | ### `Parser.parseExpression` function 12 | 13 | The entry point of the the Mathematical Expression Parser is the `parseExpression` 14 | function defined in the `Parser` module. This function takes a string, and will 15 | return either `Success of ExpressionTree` or `Failure of String` where the string 16 | contains the error message. 17 | 18 | ### `ExpressionTrees` 19 | 20 | The expression tree is defined as follows: 21 | 22 | The base object is the `ExpressionType`. Which describes a complete (sub-)tree. 23 | An `ExpressionType` is either a `ComposedExpression` of type 24 | `ComposedExpressionType` or an `AtomicExpression` of the type 25 | `AtomicExpressionType`, which cannot be subdivided further. A 26 | `ComposedExpressionType` is a record consisting of an operator, and two other 27 | `ExpressionTypes`. An `AtomicExpressionType` is either a `Parameter` or a 28 | `Constant`. 29 | 30 | ### Defined syntax 31 | 32 | The supported syntax is defined as follows: 33 | 34 | * Parameter: any term starting with a capitalised letter or an underscore, 35 | containing letters, numbers, and/or underscores. 36 | * Constant: Any floating point value, e.g. `1`, `1.0`, `1E-3`. This includes 37 | negative values. 38 | * Infix functions: 39 | Infix functions are defined as ` `. 40 | The following infix functions are currently defined: 41 | * Multiplication: `*` 42 | * Division: `/` 43 | * Addition: `+` 44 | * Subtraction: `-` 45 | * Binary functions: 46 | Binary functions are defined as terms starting with a lowercase letter, 47 | containing letters, numbers, and/or underscores, followed by a set of 48 | parentheses (without white space). The set of accepted binary functions 49 | is currently limited to the following: 50 | * Minimum: `min` 51 | * Maximum: `max` 52 | 53 | If no precedence is defined through parentheses, then standard precedence of 54 | mathematical operators assumed, i.e. division and multiplication take 55 | precedence over subtraction and addition. 56 | 57 | Whitespace inbetween terms, as well as at the beginning and end will be ignored, 58 | this includes new lines. 59 | 60 | ## How to add to an existing solution 61 | 62 | There are two ways to incorporate the Mathematical Expression Parser into a 63 | project. The recommended approach is to generate a NuGet package of the 64 | MathematicalExpressionParser.Core as described in the How to build section. 65 | This package can then be added to your existing project. 66 | 67 | Alternatively, the packages can be added directly to a .net solution. This 68 | does require the F# tooling within Visual Studio. The projects can then 69 | be referenced directly from within the solution. 70 | 71 | ## How to build: 72 | 73 | The repository can be obtained by running 74 | 75 | ```bash 76 | git clone https://github.com/Deltares/mathematical_expression_parser.git 77 | ``` 78 | 79 | Once downloaded, the `.sln` file can be opened with Visual Studio. This 80 | should allow you to build the project, and run the tests. Keep in mind that 81 | this requires the F# build tools, which can be obtained through the Visual 82 | Studio installer. 83 | 84 | In order to build the NuGet package, first build the solution in `Release`. 85 | Then navigate to the `MathematicalExpressionParser.Core` folder and run the 86 | following command: 87 | 88 | ```bash 89 | nuget pack -properties Configuration=Release 90 | ``` 91 | 92 | This will create the MathematicalExpressionParser.core NuGet Package of the 93 | current version. 94 | 95 | ## Technologies 96 | 97 | The Mathematical Expression Parser has been build with the following 98 | technologies: 99 | 100 | * [Visual Studio 2019](https://visualstudio.microsoft.com/vs/): Used to build 101 | the project. This requires the F# build tools. 102 | * [FParsec](https://www.quanttec.com/fparsec/): Parser combinator library used 103 | to transform the mathematical expression into symbolic expression trees. 104 | * [FParsec-Pipes](https://rspeele.github.io/FParsec-Pipes/): Additional 105 | extensions for FParsec 106 | * [FsUnit](https://fsprojects.github.io/FsUnit/): Used to write the test suite. 107 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core/ExpressionParser.fs: -------------------------------------------------------------------------------- 1 | // Copyright 2025 © Deltares 2 | // 3 | // This file is part of the Mathematical Expression Parser. 4 | // 5 | // The Mathematical Expression Parser is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | // 10 | // The Mathematical Expression Parser is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | // 15 | // You should have received a copy of the GNU General Public License 16 | // along with the Mathematical Expression Parser. If not, see 17 | 18 | /// 19 | /// ExpressionParser.fs defines the Domain Specific Language (DSL) 20 | /// for the simple mathematical expressions required for the real-time 21 | /// control (RTC). 22 | /// The language is defined as follows: 23 | /// * A is defined as: 24 | /// any identifier starting with a Capital character or '_' 25 | /// containing only letters, digits and '_' 26 | /// * A is defined as: 27 | /// any float in either fixed point or scientific notation. 28 | /// * A is defined as: 29 | /// ( expression1, expression2 ) 30 | /// * An is defined as: 31 | /// expression1 expression 2 32 | /// 33 | namespace MathematicalExpressionParser.Core.ExpressionParser 34 | 35 | open FParsec 36 | open FParsec.Pipes 37 | 38 | open MathematicalExpressionParser.Core.ExpressionTree 39 | 40 | module public Parser = 41 | let private ws = spaces 42 | let private str_ws s = pstring s >>. ws 43 | 44 | let private operatorPrecedenceParser = 45 | new OperatorPrecedenceParser() 46 | 47 | let private pExpr = operatorPrecedenceParser.ExpressionParser 48 | 49 | let private pParameter = 50 | let isParameterFirstChar c = (isLetter c && isUpper c) ||c = '_' 51 | let isParameterChar c = isLetter c || isDigit c || c = '_' 52 | 53 | ( many1Satisfy2L isParameterFirstChar isParameterChar "parameter" 54 | .>> ws ) |>> Parameter 55 | 56 | let private pConstant = 57 | ( pfloat .>> ws ) |>> Constant 58 | 59 | let private pBinaryFunctionExpr = 60 | let strRet ((s : string), (v : BinaryFunctionType)) = stringReturn s v 61 | let ident = choice ( List.map strRet Expression.binaryFunctions ) |>> BinaryFunction 62 | %% +.ident 63 | -- ( str_ws "(" ) 64 | -- +.pExpr -- ( str_ws "," ) 65 | -- +.pExpr 66 | -- ( str_ws ")" ) 67 | -|> Expression.composedExpression |>> ComposedExpression 68 | 69 | let private pAtomExpr = 70 | (pConstant <|> pParameter) |>> AtomicExpression 71 | 72 | let private pParenthesizedTerm = 73 | between (str_ws "(") (str_ws ")") 74 | 75 | let private pTerm = 76 | choice [ pAtomExpr 77 | ; pBinaryFunctionExpr 78 | ; (pParenthesizedTerm pExpr) 79 | ] 80 | operatorPrecedenceParser.TermParser <- pTerm 81 | 82 | for (ident, infixType, precedence) in Expression.infixFunctions do 83 | let composedInfixExpression lOperand rOperand = 84 | ComposedExpression ( Expression.composedExpression ( InfixFunction infixType ) lOperand rOperand ) 85 | operatorPrecedenceParser.AddOperator(InfixOperator(ident, ws, precedence, Associativity.Left, composedInfixExpression )) 86 | 87 | let private pExprComplete = ws >>. pExpr .>> eof 88 | 89 | /// 90 | /// Parse the provided string to a 91 | /// 92 | /// The string to be parsed. 94 | /// The corresponding with the provided 95 | /// . 96 | /// 97 | /// 98 | /// Thrown when the provided cannot be parsed. 99 | /// 100 | let public parseExpression (str : string) = 101 | match run pExprComplete str with 102 | | FParsec.CharParsers.Success(result, _, _) -> Success result 103 | | FParsec.CharParsers.Failure(errorMsg, _, _) -> Failure errorMsg 104 | 105 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | ### Windows ### 2 | # Windows image file caches 3 | Thumbs.db 4 | ehthumbs.db 5 | 6 | # Folder config file 7 | Desktop.ini 8 | 9 | # Recycle Bin used on file shares 10 | $RECYCLE.BIN/ 11 | 12 | # Windows Installer files 13 | *.cab 14 | *.msi 15 | *.msm 16 | *.msp 17 | 18 | # Windows shortcuts 19 | *.lnk 20 | 21 | 22 | ### Linux ### 23 | *~ 24 | 25 | # temporary files which can be created if a process still has a handle open of a deleted file 26 | .fuse_hidden* 27 | 28 | # KDE directory preferences 29 | .directory 30 | 31 | # Linux trash folder which might appear on any partition or disk 32 | .Trash-* 33 | 34 | 35 | ## Ignore Visual Studio temporary files, build results, and 36 | ## files generated by popular Visual Studio add-ons. 37 | ## 38 | ## Get latest from https://github.com/github/gitignore/blob/master/VisualStudio.gitignore 39 | 40 | # User-specific files 41 | *.rsuser 42 | *.suo 43 | *.user 44 | *.userosscache 45 | *.sln.docstates 46 | 47 | # User-specific files (MonoDevelop/Xamarin Studio) 48 | *.userprefs 49 | 50 | # Mono auto generated files 51 | mono_crash.* 52 | 53 | # Build results 54 | [Dd]ebug/ 55 | [Dd]ebugPublic/ 56 | [Rr]elease/ 57 | [Rr]eleases/ 58 | x64/ 59 | x86/ 60 | [Aa][Rr][Mm]/ 61 | [Aa][Rr][Mm]64/ 62 | bld/ 63 | [Bb]in/ 64 | [Oo]bj/ 65 | [Ll]og/ 66 | [Ll]ogs/ 67 | 68 | # Visual Studio 2015/2017 cache/options directory 69 | .vs/ 70 | # Uncomment if you have tasks that create the project's static files in wwwroot 71 | #wwwroot/ 72 | 73 | # Visual Studio 2017 auto generated files 74 | Generated\ Files/ 75 | 76 | # Rider 77 | .idea/ 78 | 79 | # MSTest test Results 80 | [Tt]est[Rr]esult*/ 81 | [Bb]uild[Ll]og.* 82 | 83 | # NUnit 84 | *.VisualState.xml 85 | TestResult.xml 86 | nunit-*.xml 87 | 88 | # Build Results of an ATL Project 89 | [Dd]ebugPS/ 90 | [Rr]eleasePS/ 91 | dlldata.c 92 | 93 | # Benchmark Results 94 | BenchmarkDotNet.Artifacts/ 95 | 96 | # .NET Core 97 | project.lock.json 98 | project.fragment.lock.json 99 | artifacts/ 100 | 101 | # StyleCop 102 | StyleCopReport.xml 103 | 104 | # Files built by Visual Studio 105 | *_i.c 106 | *_p.c 107 | *_h.h 108 | *.ilk 109 | *.meta 110 | *.obj 111 | *.iobj 112 | *.pch 113 | *.pdb 114 | *.ipdb 115 | *.pgc 116 | *.pgd 117 | *.rsp 118 | *.sbr 119 | *.tlb 120 | *.tli 121 | *.tlh 122 | *.tmp 123 | *.tmp_proj 124 | *_wpftmp.csproj 125 | *.log 126 | *.vspscc 127 | *.vssscc 128 | .builds 129 | *.pidb 130 | *.svclog 131 | *.scc 132 | 133 | # Chutzpah Test files 134 | _Chutzpah* 135 | 136 | # Visual C++ cache files 137 | ipch/ 138 | *.aps 139 | *.ncb 140 | *.opendb 141 | *.opensdf 142 | *.sdf 143 | *.cachefile 144 | *.VC.db 145 | *.VC.VC.opendb 146 | 147 | # Visual Studio profiler 148 | *.psess 149 | *.vsp 150 | *.vspx 151 | *.sap 152 | 153 | # Visual Studio Trace Files 154 | *.e2e 155 | 156 | # TFS 2012 Local Workspace 157 | $tf/ 158 | 159 | # Guidance Automation Toolkit 160 | *.gpState 161 | 162 | # ReSharper is a .NET coding add-in 163 | _ReSharper*/ 164 | *.[Rr]e[Ss]harper 165 | *.DotSettings.user 166 | 167 | # TeamCity is a build add-in 168 | _TeamCity* 169 | 170 | # DotCover is a Code Coverage Tool 171 | *.dotCover 172 | 173 | # AxoCover is a Code Coverage Tool 174 | .axoCover/* 175 | !.axoCover/settings.json 176 | 177 | # Visual Studio code coverage results 178 | *.coverage 179 | *.coveragexml 180 | 181 | # NCrunch 182 | _NCrunch_* 183 | .*crunch*.local.xml 184 | nCrunchTemp_* 185 | 186 | # MightyMoose 187 | *.mm.* 188 | AutoTest.Net/ 189 | 190 | # Web workbench (sass) 191 | .sass-cache/ 192 | 193 | # Installshield output folder 194 | [Ee]xpress/ 195 | 196 | # DocProject is a documentation generator add-in 197 | DocProject/buildhelp/ 198 | DocProject/Help/*.HxT 199 | DocProject/Help/*.HxC 200 | DocProject/Help/*.hhc 201 | DocProject/Help/*.hhk 202 | DocProject/Help/*.hhp 203 | DocProject/Help/Html2 204 | DocProject/Help/html 205 | 206 | # Click-Once directory 207 | publish/ 208 | 209 | # Publish Web Output 210 | *.[Pp]ublish.xml 211 | *.azurePubxml 212 | # Note: Comment the next line if you want to checkin your web deploy settings, 213 | # but database connection strings (with potential passwords) will be unencrypted 214 | *.pubxml 215 | *.publishproj 216 | 217 | # Microsoft Azure Web App publish settings. Comment the next line if you want to 218 | # checkin your Azure Web App publish settings, but sensitive information contained 219 | # in these scripts will be unencrypted 220 | PublishScripts/ 221 | 222 | # NuGet Packages 223 | *.nupkg 224 | # NuGet Symbol Packages 225 | *.snupkg 226 | # The packages folder can be ignored because of Package Restore 227 | **/[Pp]ackages/* 228 | # except build/, which is used as an MSBuild target. 229 | !**/[Pp]ackages/build/ 230 | # Uncomment if necessary however generally it will be regenerated when needed 231 | #!**/[Pp]ackages/repositories.config 232 | # NuGet v3's project.json files produces more ignorable files 233 | *.nuget.props 234 | *.nuget.targets 235 | 236 | # Microsoft Azure Build Output 237 | csx/ 238 | *.build.csdef 239 | 240 | # Microsoft Azure Emulator 241 | ecf/ 242 | rcf/ 243 | 244 | # Windows Store app package directories and files 245 | AppPackages/ 246 | BundleArtifacts/ 247 | Package.StoreAssociation.xml 248 | _pkginfo.txt 249 | *.appx 250 | *.appxbundle 251 | *.appxupload 252 | 253 | # Visual Studio cache files 254 | # files ending in .cache can be ignored 255 | *.[Cc]ache 256 | # but keep track of directories ending in .cache 257 | !?*.[Cc]ache/ 258 | 259 | # Others 260 | ClientBin/ 261 | ~$* 262 | *~ 263 | *.dbmdl 264 | *.dbproj.schemaview 265 | *.jfm 266 | *.pfx 267 | *.publishsettings 268 | orleans.codegen.cs 269 | 270 | # Including strong name files can present a security risk 271 | # (https://github.com/github/gitignore/pull/2483#issue-259490424) 272 | #*.snk 273 | 274 | # Since there are multiple workflows, uncomment next line to ignore bower_components 275 | # (https://github.com/github/gitignore/pull/1529#issuecomment-104372622) 276 | #bower_components/ 277 | 278 | # RIA/Silverlight projects 279 | Generated_Code/ 280 | 281 | # Backup & report files from converting an old project file 282 | # to a newer Visual Studio version. Backup files are not needed, 283 | # because we have git ;-) 284 | _UpgradeReport_Files/ 285 | Backup*/ 286 | UpgradeLog*.XML 287 | UpgradeLog*.htm 288 | ServiceFabricBackup/ 289 | *.rptproj.bak 290 | 291 | # SQL Server files 292 | *.mdf 293 | *.ldf 294 | *.ndf 295 | 296 | # Business Intelligence projects 297 | *.rdl.data 298 | *.bim.layout 299 | *.bim_*.settings 300 | *.rptproj.rsuser 301 | *- [Bb]ackup.rdl 302 | *- [Bb]ackup ([0-9]).rdl 303 | *- [Bb]ackup ([0-9][0-9]).rdl 304 | 305 | # Microsoft Fakes 306 | FakesAssemblies/ 307 | 308 | # GhostDoc plugin setting file 309 | *.GhostDoc.xml 310 | 311 | # Node.js Tools for Visual Studio 312 | .ntvs_analysis.dat 313 | node_modules/ 314 | 315 | # Visual Studio 6 build log 316 | *.plg 317 | 318 | # Visual Studio 6 workspace options file 319 | *.opt 320 | 321 | # Visual Studio 6 auto-generated workspace file (contains which files were open etc.) 322 | *.vbw 323 | 324 | # Visual Studio LightSwitch build output 325 | **/*.HTMLClient/GeneratedArtifacts 326 | **/*.DesktopClient/GeneratedArtifacts 327 | **/*.DesktopClient/ModelManifest.xml 328 | **/*.Server/GeneratedArtifacts 329 | **/*.Server/ModelManifest.xml 330 | _Pvt_Extensions 331 | 332 | # Paket dependency manager 333 | .paket/paket.exe 334 | paket-files/ 335 | 336 | # FAKE - F# Make 337 | .fake/ 338 | 339 | # CodeRush personal settings 340 | .cr/personal 341 | 342 | # Python Tools for Visual Studio (PTVS) 343 | __pycache__/ 344 | *.pyc 345 | 346 | # Cake - Uncomment if you are using it 347 | # tools/** 348 | # !tools/packages.config 349 | 350 | # Tabs Studio 351 | *.tss 352 | 353 | # Telerik's JustMock configuration file 354 | *.jmconfig 355 | 356 | # BizTalk build output 357 | *.btp.cs 358 | *.btm.cs 359 | *.odx.cs 360 | *.xsd.cs 361 | 362 | # OpenCover UI analysis results 363 | OpenCover/ 364 | 365 | # Azure Stream Analytics local run output 366 | ASALocalRun/ 367 | 368 | # MSBuild Binary and Structured Log 369 | *.binlog 370 | 371 | # NVidia Nsight GPU debugger configuration file 372 | *.nvuser 373 | 374 | # MFractors (Xamarin productivity tool) working folder 375 | .mfractor/ 376 | 377 | # Local History for Visual Studio 378 | .localhistory/ 379 | 380 | # BeatPulse healthcheck temp database 381 | healthchecksdb 382 | 383 | # Backup folder for Package Reference Convert tool in Visual Studio 2017 384 | MigrationBackup/ 385 | 386 | # Ionide (cross platform F# VS Code tools) working folder 387 | .ionide/ 388 | 389 | # NuGet Packages 390 | *.nupkg 391 | # The packages folder can be ignored because of Package Restore 392 | **/packages/* 393 | # except build/, which is used as an MSBuild target. 394 | !**/packages/build/ 395 | # Uncomment if necessary however generally it will be regenerated when needed 396 | #!**/packages/repositories.config 397 | # NuGet v3's project.json files produces more ignoreable files 398 | *.nuget.props 399 | *.nuget.targets 400 | 401 | # Org-mode 402 | .org-id-locations 403 | *_archive 404 | 405 | # flymake-mode 406 | *_flymake.* 407 | 408 | # eshell files 409 | /eshell/history 410 | /eshell/lastdir 411 | 412 | # elpa packages 413 | /elpa/ 414 | 415 | # reftex files 416 | *.rel 417 | 418 | # AUCTeX auto folder 419 | /auto/ 420 | 421 | # cask packages 422 | .cask/ 423 | 424 | # Flycheck 425 | flycheck_*.el 426 | 427 | # server auth directory 428 | /server/ 429 | 430 | # projectiles files 431 | .projectile 432 | -------------------------------------------------------------------------------- /MathematicalExpressionParser.Core.Test/ExpressionParserTest.fs: -------------------------------------------------------------------------------- 1 | // Copyright 2025 © Deltares 2 | // 3 | // This file is part of the Mathematical Expression Parser. 4 | // 5 | // The Mathematical Expression Parser is free software: you can redistribute it and/or modify 6 | // it under the terms of the GNU General Public License as published by 7 | // the Free Software Foundation, either version 3 of the License, or 8 | // (at your option) any later version. 9 | // 10 | // The Mathematical Expression Parser is distributed in the hope that it will be useful, 11 | // but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | // GNU General Public License for more details. 14 | // 15 | // You should have received a copy of the GNU General Public License 16 | // along with the Mathematical Expression Parser. If not, see 17 | 18 | module MathematicalExpressionParser.Core.ExpressionParserTest 19 | 20 | open MathematicalExpressionParser.Core.ExpressionTree 21 | open MathematicalExpressionParser.Core.ExpressionParser 22 | 23 | open FsUnit 24 | open NUnit.Framework 25 | 26 | [] 27 | type ParseExpressionTest() = 28 | static let paramExpr str = AtomicExpression ( Parameter str ) 29 | static let constExpr d = AtomicExpression ( Constant d ) 30 | 31 | static member parseExpressionParameterCorrectData = 32 | [| 33 | [| ("Parameter", Success <| ( paramExpr "Parameter" )) |] 34 | [| ("Parameter012", Success <| ( paramExpr "Parameter012" )) |] 35 | [| ("Param3t3r", Success <| ( paramExpr "Param3t3r" )) |] 36 | [| ("_Param", Success <| ( paramExpr "_Param" )) |] 37 | [| ("_Param3t3r", Success <| ( paramExpr "_Param3t3r" )) |] 38 | [| ("A", Success <| ( paramExpr "A" )) |] 39 | [| ("ABBCab", Success <| ( paramExpr "ABBCab" )) |] 40 | [| ("ABB_Cab", Success <| ( paramExpr "ABB_Cab" )) |] 41 | |] 42 | 43 | static member parseExpressionConstantCorrectData = 44 | [| 45 | [| ("1.0", Success <| ( constExpr 1.0 )) |] 46 | [| ("0.55", Success <| ( constExpr 0.55 )) |] 47 | [| ("-0.55", Success <| ( constExpr -0.55 )) |] 48 | [| ("1E-3", Success <| ( constExpr 0.001 )) |] 49 | [| ("1.0E-3", Success <| ( constExpr 0.001 )) |] 50 | [| ("1.57E-3", Success <| ( constExpr 0.00157 )) |] 51 | [| ("1.57E3", Success <| ( constExpr 1570.0 )) |] 52 | [| ("-1.57E3", Success <| ( constExpr -1570.0 )) |] 53 | |] 54 | 55 | static member parseExpressionBinaryFunctionCorrectData = 56 | [| 57 | [| ("min(A,B)", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "A" ) ( paramExpr "B" ))) |] 58 | [| ("min( A , B )", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "A" ) ( paramExpr "B" ))) |] 59 | [| ("max(A,B)", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Max ) ( paramExpr "A" ) ( paramExpr "B" ))) |] 60 | [| ("max( A , B )", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Max ) ( paramExpr "A" ) ( paramExpr "B" ))) |] 61 | [| ("max( min( A, B) , min( C, D) )", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Max ) 62 | ( ComposedExpression ( Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "A" ) ( paramExpr "B" ))) 63 | ( ComposedExpression ( Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "C" ) ( paramExpr "D" ))) ))|] 64 | [| ("max( A, min( C, D) )", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Max ) 65 | ( paramExpr "A" ) 66 | ( ComposedExpression ( Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "C" ) ( paramExpr "D" )))))|] 67 | [| ("max( min( A, B) , C)", Success <| ComposedExpression (Expression.composedExpression ( BinaryFunction Max ) 68 | ( ComposedExpression ( Expression.composedExpression ( BinaryFunction Min ) ( paramExpr "A" ) ( paramExpr "B" ))) 69 | ( paramExpr "C" ))) |] 70 | |] 71 | 72 | static member parseExpressionInfixFunctionCorrectData = 73 | [| 74 | [| ("A*B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))) |] 75 | [| (" A * B ", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))) |] 76 | [| ("A/B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))) |] 77 | [| (" A / B ", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))) |] 78 | [| ("A+B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "A") ( paramExpr "B" ))) |] 79 | [| (" A + B ", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "A") ( paramExpr "B" ))) |] 80 | [| ("A-B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "A") ( paramExpr "B" ))) |] 81 | [| (" A - B ", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "A") ( paramExpr "B" ))) |] 82 | |] 83 | 84 | static member parseExpressionAssociativityCorrectData = 85 | [| 86 | [| ("A*B+C", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) 87 | (ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))) 88 | (paramExpr "C"))) |] 89 | [| ("A*B-C", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) 90 | (ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))) 91 | (paramExpr "C"))) |] 92 | [| ("A/B+C", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) 93 | (ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))) 94 | (paramExpr "C"))) |] 95 | [| ("A/B-C", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) 96 | (ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))) 97 | (paramExpr "C"))) |] 98 | [| ("C+A*B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) 99 | (paramExpr "C") 100 | (ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))))) |] 101 | [| ("C-A*B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) 102 | (paramExpr "C") 103 | (ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) ( paramExpr "A") ( paramExpr "B" ))))) |] 104 | [| ("C+A/B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Addition) 105 | (paramExpr "C") 106 | (ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))))) |] 107 | [| ("C-A/B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) 108 | (paramExpr "C") 109 | (ComposedExpression (Expression.composedExpression (InfixFunction Division) ( paramExpr "A") ( paramExpr "B" ))))) |] 110 | |] 111 | 112 | static member parseExpressionParenthesesCorrectData = 113 | [| 114 | [| ("A*(B+C)", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) 115 | (paramExpr "A") 116 | (ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "B") ( paramExpr "C" ))))) |] 117 | [| ("A*(B-C)", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) 118 | (paramExpr "A") 119 | (ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "B") ( paramExpr "C" ))))) |] 120 | [| ("A/(B+C)", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) 121 | (paramExpr "A") 122 | (ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "B") ( paramExpr "C" ))))) |] 123 | [| ("A/(B-C)", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) 124 | (paramExpr "A") 125 | (ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "B") ( paramExpr "C" ))))) |] 126 | [| ("(C+A)*B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) 127 | (ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "C") ( paramExpr "A" ))) 128 | (paramExpr "B"))) |] 129 | [| ("(C-A)*B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Multiplication) 130 | (ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "C") ( paramExpr "A" ))) 131 | (paramExpr "B"))) |] 132 | [| ("(C+A)/B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) 133 | (ComposedExpression (Expression.composedExpression (InfixFunction Addition) ( paramExpr "C") ( paramExpr "A" ))) 134 | (paramExpr "B"))) |] 135 | [| ("(C-A)/B", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) 136 | (ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "C") ( paramExpr "A" ))) 137 | (paramExpr "B"))) |] 138 | [| ("((C)-(A))/(B)", Success <| ComposedExpression (Expression.composedExpression (InfixFunction Division) 139 | (ComposedExpression (Expression.composedExpression (InfixFunction Subtraction) ( paramExpr "C") ( paramExpr "A" ))) 140 | (paramExpr "B"))) |] 141 | |] 142 | 143 | [] 149 | member x.``parseExpression: Correct results`` (data : string * ParserResult) = 150 | let inputString, expectedResult = data in 151 | ( Parser.parseExpression inputString ) |> should equal expectedResult 152 | 153 | [] 154 | [] 155 | [] 156 | [] 157 | [] 158 | [] 159 | [] 160 | [] 161 | [] 162 | [] 163 | member x.``parseExpression: Failure to parse`` (inputString : string) = 164 | match Parser.parseExpression inputString with 165 | | Failure _ -> Assert.Pass() 166 | | Success _ -> Assert.Fail("Expected Failure but got Success") 167 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------