My algorithm to convert a Regular Expression to a Regular Grammar is based on mostly two online resources.
Other similar online resources on the same topic may be found at:
sahil-jindal
/ base64-utf8.module.js
Created
August 18, 2022 14:50
— forked from nijikokun/base64-utf8.module.js
Javascript Base64 UTF8 for the Browser / Server. Base64 UTF-8 Encoding and Decoding Libraries / Modules for AMD, CommonJS, Nodejs and Browsers. Cross-browser compatible.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // UTF8 Module | |
| // | |
| // Cleaner and modularized utf-8 encoding and decoding library for javascript. | |
| // | |
| // copyright: MIT | |
| // author: Nijiko Yonskai, @nijikokun, [email protected] | |
| (function (name, definition, context, dependencies) { | |
| if (typeof context['module'] !== 'undefined' && context['module']['exports']) { if (dependencies && context['require']) { for (var i = 0; i < dependencies.length; i++) context[dependencies[i]] = context['require'](dependencies[i]); } context['module']['exports'] = definition.apply(context); } | |
| else if (typeof context['define'] !== 'undefined' && context['define'] === 'function' && context['define']['amd']) { define(name, (dependencies || []), definition); } | |
| else { context[name] = definition.apply(context); } |
sahil-jindal
/ RE_to_Grammar_Algorithm.md
Created
March 2, 2021 11:21
— forked from santanuchakrabarti/RE_to_Grammar_Algorithm.md
An algorithm to generate a Regular Grammar from a Regular Expression